YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 09:12:11,001 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 09:12:11,003 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 09:12:11,015 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 09:12:11,015 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 09:12:11,016 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 09:12:11,017 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 09:12:11,019 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 09:12:11,021 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 09:12:11,021 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 09:12:11,022 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 09:12:11,022 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 09:12:11,023 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 09:12:11,024 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 09:12:11,025 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 09:12:11,026 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 09:12:11,026 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 09:12:11,028 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 09:12:11,030 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 09:12:11,032 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 09:12:11,033 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 09:12:11,034 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 09:12:11,036 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 09:12:11,037 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 09:12:11,037 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 09:12:11,038 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 09:12:11,038 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 09:12:11,039 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 09:12:11,039 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 09:12:11,040 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 09:12:11,040 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 09:12:11,041 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 09:12:11,042 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 09:12:11,042 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 09:12:11,043 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 09:12:11,043 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 09:12:11,043 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 09:12:11,044 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 09:12:11,045 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 09:12:11,045 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 09:12:11,059 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 09:12:11,060 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 09:12:11,061 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 09:12:11,061 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 09:12:11,061 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 09:12:11,061 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:12:11,062 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 09:12:11,062 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 09:12:11,062 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 09:12:11,062 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 09:12:11,062 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 09:12:11,063 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 09:12:11,063 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 09:12:11,063 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 09:12:11,063 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 09:12:11,063 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 09:12:11,063 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 09:12:11,064 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 09:12:11,064 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 09:12:11,064 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 09:12:11,064 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 09:12:11,064 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 09:12:11,065 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 09:12:11,065 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 09:12:11,065 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:12:11,065 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 09:12:11,065 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 09:12:11,065 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 09:12:11,066 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 09:12:11,091 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 09:12:11,104 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 09:12:11,108 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 09:12:11,109 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 09:12:11,110 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 09:12:11,110 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 09:12:11,177 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/a3d2a30ac07e473aa645d8fc3bf8ae06/FLAGe92146036 [2020-06-22 09:12:11,537 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 09:12:11,538 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 09:12:11,538 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 09:12:11,545 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/a3d2a30ac07e473aa645d8fc3bf8ae06/FLAGe92146036 [2020-06-22 09:12:11,928 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/a3d2a30ac07e473aa645d8fc3bf8ae06 [2020-06-22 09:12:11,939 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 09:12:11,941 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 09:12:11,942 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 09:12:11,942 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 09:12:11,946 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 09:12:11,947 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:12:11" (1/1) ... [2020-06-22 09:12:11,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ceca08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:12:11, skipping insertion in model container [2020-06-22 09:12:11,950 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:12:11" (1/1) ... [2020-06-22 09:12:11,957 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 09:12:11,975 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 09:12:12,210 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:12:12,225 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 09:12:12,246 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:12:12,262 INFO L195 MainTranslator]: Completed translation [2020-06-22 09:12:12,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:12:12 WrapperNode [2020-06-22 09:12:12,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 09:12:12,264 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 09:12:12,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 09:12:12,264 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 09:12:12,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:12:12" (1/1) ... [2020-06-22 09:12:12,283 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:12:12" (1/1) ... [2020-06-22 09:12:12,305 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 09:12:12,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 09:12:12,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 09:12:12,305 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 09:12:12,316 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:12:12" (1/1) ... [2020-06-22 09:12:12,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:12:12" (1/1) ... [2020-06-22 09:12:12,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:12:12" (1/1) ... [2020-06-22 09:12:12,318 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:12:12" (1/1) ... [2020-06-22 09:12:12,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:12:12" (1/1) ... [2020-06-22 09:12:12,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:12:12" (1/1) ... [2020-06-22 09:12:12,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:12:12" (1/1) ... [2020-06-22 09:12:12,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 09:12:12,332 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 09:12:12,332 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 09:12:12,332 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 09:12:12,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:12:12" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:12:12,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 09:12:12,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 09:12:12,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 09:12:12,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 09:12:12,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 09:12:12,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 09:12:12,653 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 09:12:12,654 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 09:12:12,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:12:12 BoogieIcfgContainer [2020-06-22 09:12:12,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 09:12:12,656 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 09:12:12,656 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 09:12:12,659 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 09:12:12,659 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:12:12" (1/1) ... [2020-06-22 09:12:12,680 INFO L313 BlockEncoder]: Initial Icfg 22 locations, 26 edges [2020-06-22 09:12:12,682 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 09:12:12,683 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 09:12:12,684 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 09:12:12,684 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:12:12,686 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 09:12:12,687 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 09:12:12,687 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 09:12:12,708 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 09:12:12,737 INFO L200 BlockEncoder]: SBE split 8 edges [2020-06-22 09:12:12,742 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 09:12:12,744 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:12:12,779 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding [2020-06-22 09:12:12,781 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-06-22 09:12:12,783 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 09:12:12,783 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:12:12,784 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 09:12:12,784 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 09:12:12,785 INFO L313 BlockEncoder]: Encoded RCFG 15 locations, 27 edges [2020-06-22 09:12:12,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:12:12 BasicIcfg [2020-06-22 09:12:12,785 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 09:12:12,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 09:12:12,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 09:12:12,790 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 09:12:12,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 09:12:11" (1/4) ... [2020-06-22 09:12:12,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6895b0fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:12:12, skipping insertion in model container [2020-06-22 09:12:12,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:12:12" (2/4) ... [2020-06-22 09:12:12,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6895b0fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:12:12, skipping insertion in model container [2020-06-22 09:12:12,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:12:12" (3/4) ... [2020-06-22 09:12:12,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6895b0fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:12:12, skipping insertion in model container [2020-06-22 09:12:12,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:12:12" (4/4) ... [2020-06-22 09:12:12,795 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:12:12,806 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 09:12:12,815 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-06-22 09:12:12,834 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-06-22 09:12:12,864 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:12:12,865 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 09:12:12,865 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 09:12:12,865 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:12:12,865 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:12:12,865 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:12:12,865 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 09:12:12,866 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:12:12,866 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 09:12:12,881 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-06-22 09:12:12,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:12:12,887 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:12:12,887 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:12:12,888 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 09:12:12,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:12:12,894 INFO L82 PathProgramCache]: Analyzing trace with hash 126038835, now seen corresponding path program 1 times [2020-06-22 09:12:12,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:12:12,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:12:12,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:12,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:12:12,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:12:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:12:13,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:12:13,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:12:13,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:12:13,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:12:13,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:12:13,087 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2020-06-22 09:12:13,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:12:13,168 INFO L93 Difference]: Finished difference Result 15 states and 27 transitions. [2020-06-22 09:12:13,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:12:13,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:12:13,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:12:13,183 INFO L225 Difference]: With dead ends: 15 [2020-06-22 09:12:13,183 INFO L226 Difference]: Without dead ends: 14 [2020-06-22 09:12:13,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:12:13,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-06-22 09:12:13,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-06-22 09:12:13,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 09:12:13,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2020-06-22 09:12:13,225 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 5 [2020-06-22 09:12:13,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:12:13,226 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2020-06-22 09:12:13,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:12:13,227 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2020-06-22 09:12:13,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:12:13,227 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:12:13,227 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:12:13,228 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 09:12:13,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:12:13,228 INFO L82 PathProgramCache]: Analyzing trace with hash 126038837, now seen corresponding path program 1 times [2020-06-22 09:12:13,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:12:13,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:12:13,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:13,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:12:13,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:12:13,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:12:13,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:12:13,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:12:13,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:12:13,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:12:13,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:12:13,281 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 4 states. [2020-06-22 09:12:13,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:12:13,345 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2020-06-22 09:12:13,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:12:13,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 09:12:13,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:12:13,346 INFO L225 Difference]: With dead ends: 15 [2020-06-22 09:12:13,346 INFO L226 Difference]: Without dead ends: 14 [2020-06-22 09:12:13,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:12:13,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-06-22 09:12:13,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-06-22 09:12:13,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 09:12:13,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 24 transitions. [2020-06-22 09:12:13,351 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 24 transitions. Word has length 5 [2020-06-22 09:12:13,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:12:13,351 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 24 transitions. [2020-06-22 09:12:13,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:12:13,351 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 24 transitions. [2020-06-22 09:12:13,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:12:13,352 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:12:13,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:12:13,352 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 09:12:13,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:12:13,352 INFO L82 PathProgramCache]: Analyzing trace with hash 126038838, now seen corresponding path program 1 times [2020-06-22 09:12:13,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:12:13,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:12:13,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:13,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:12:13,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:12:13,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:12:13,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:12:13,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:12:13,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:12:13,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:12:13,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:12:13,389 INFO L87 Difference]: Start difference. First operand 14 states and 24 transitions. Second operand 3 states. [2020-06-22 09:12:13,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:12:13,443 INFO L93 Difference]: Finished difference Result 14 states and 24 transitions. [2020-06-22 09:12:13,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:12:13,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:12:13,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:12:13,444 INFO L225 Difference]: With dead ends: 14 [2020-06-22 09:12:13,444 INFO L226 Difference]: Without dead ends: 13 [2020-06-22 09:12:13,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:12:13,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-06-22 09:12:13,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-06-22 09:12:13,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 09:12:13,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2020-06-22 09:12:13,448 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 5 [2020-06-22 09:12:13,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:12:13,449 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2020-06-22 09:12:13,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:12:13,449 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2020-06-22 09:12:13,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 09:12:13,449 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:12:13,449 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:12:13,450 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 09:12:13,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:12:13,450 INFO L82 PathProgramCache]: Analyzing trace with hash 864253169, now seen corresponding path program 1 times [2020-06-22 09:12:13,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:12:13,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:12:13,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:13,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:12:13,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:12:13,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:12:13,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:12:13,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 09:12:13,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 09:12:13,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 09:12:13,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:12:13,501 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 5 states. [2020-06-22 09:12:13,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:12:13,610 INFO L93 Difference]: Finished difference Result 22 states and 36 transitions. [2020-06-22 09:12:13,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:12:13,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2020-06-22 09:12:13,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:12:13,612 INFO L225 Difference]: With dead ends: 22 [2020-06-22 09:12:13,612 INFO L226 Difference]: Without dead ends: 21 [2020-06-22 09:12:13,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-06-22 09:12:13,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-06-22 09:12:13,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2020-06-22 09:12:13,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-06-22 09:12:13,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 28 transitions. [2020-06-22 09:12:13,617 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 28 transitions. Word has length 7 [2020-06-22 09:12:13,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:12:13,618 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 28 transitions. [2020-06-22 09:12:13,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 09:12:13,618 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 28 transitions. [2020-06-22 09:12:13,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 09:12:13,618 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:12:13,619 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:12:13,619 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 09:12:13,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:12:13,619 INFO L82 PathProgramCache]: Analyzing trace with hash 864253166, now seen corresponding path program 1 times [2020-06-22 09:12:13,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:12:13,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:12:13,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:13,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:12:13,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:12:13,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:12:13,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:12:13,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:12:13,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:12:13,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:12:13,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:12:13,661 INFO L87 Difference]: Start difference. First operand 15 states and 28 transitions. Second operand 4 states. [2020-06-22 09:12:13,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:12:13,721 INFO L93 Difference]: Finished difference Result 15 states and 28 transitions. [2020-06-22 09:12:13,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:12:13,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-06-22 09:12:13,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:12:13,722 INFO L225 Difference]: With dead ends: 15 [2020-06-22 09:12:13,723 INFO L226 Difference]: Without dead ends: 14 [2020-06-22 09:12:13,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:12:13,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-06-22 09:12:13,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-06-22 09:12:13,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 09:12:13,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 24 transitions. [2020-06-22 09:12:13,726 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 24 transitions. Word has length 7 [2020-06-22 09:12:13,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:12:13,726 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 24 transitions. [2020-06-22 09:12:13,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:12:13,727 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 24 transitions. [2020-06-22 09:12:13,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 09:12:13,727 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:12:13,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:12:13,728 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 09:12:13,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:12:13,728 INFO L82 PathProgramCache]: Analyzing trace with hash 864253168, now seen corresponding path program 1 times [2020-06-22 09:12:13,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:12:13,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:12:13,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:13,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:12:13,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:12:13,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:12:13,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:12:13,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 09:12:13,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 09:12:13,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 09:12:13,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-06-22 09:12:13,800 INFO L87 Difference]: Start difference. First operand 14 states and 24 transitions. Second operand 6 states. [2020-06-22 09:12:13,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:12:13,915 INFO L93 Difference]: Finished difference Result 19 states and 31 transitions. [2020-06-22 09:12:13,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 09:12:13,916 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-06-22 09:12:13,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:12:13,917 INFO L225 Difference]: With dead ends: 19 [2020-06-22 09:12:13,917 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 09:12:13,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-06-22 09:12:13,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 09:12:13,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2020-06-22 09:12:13,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 09:12:13,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. [2020-06-22 09:12:13,920 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 23 transitions. Word has length 7 [2020-06-22 09:12:13,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:12:13,921 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 23 transitions. [2020-06-22 09:12:13,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 09:12:13,921 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 23 transitions. [2020-06-22 09:12:13,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 09:12:13,921 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:12:13,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:12:13,922 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 09:12:13,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:12:13,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1022043599, now seen corresponding path program 1 times [2020-06-22 09:12:13,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:12:13,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:12:13,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:13,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:12:13,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:12:14,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:12:14,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:12:14,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 09:12:14,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 09:12:14,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 09:12:14,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-06-22 09:12:14,044 INFO L87 Difference]: Start difference. First operand 14 states and 23 transitions. Second operand 6 states. [2020-06-22 09:12:14,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:12:14,155 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. [2020-06-22 09:12:14,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 09:12:14,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-06-22 09:12:14,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:12:14,156 INFO L225 Difference]: With dead ends: 14 [2020-06-22 09:12:14,157 INFO L226 Difference]: Without dead ends: 13 [2020-06-22 09:12:14,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-06-22 09:12:14,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-06-22 09:12:14,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-06-22 09:12:14,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 09:12:14,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2020-06-22 09:12:14,160 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 21 transitions. Word has length 8 [2020-06-22 09:12:14,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:12:14,161 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 21 transitions. [2020-06-22 09:12:14,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 09:12:14,161 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 21 transitions. [2020-06-22 09:12:14,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 09:12:14,161 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:12:14,161 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:12:14,161 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 09:12:14,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:12:14,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1022043601, now seen corresponding path program 1 times [2020-06-22 09:12:14,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:12:14,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:12:14,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:14,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:12:14,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:12:14,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:12:14,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:12:14,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 09:12:14,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 09:12:14,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 09:12:14,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:12:14,200 INFO L87 Difference]: Start difference. First operand 13 states and 21 transitions. Second operand 5 states. [2020-06-22 09:12:14,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:12:14,265 INFO L93 Difference]: Finished difference Result 17 states and 26 transitions. [2020-06-22 09:12:14,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:12:14,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-06-22 09:12:14,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:12:14,267 INFO L225 Difference]: With dead ends: 17 [2020-06-22 09:12:14,268 INFO L226 Difference]: Without dead ends: 16 [2020-06-22 09:12:14,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-06-22 09:12:14,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-06-22 09:12:14,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2020-06-22 09:12:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 09:12:14,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. [2020-06-22 09:12:14,271 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 23 transitions. Word has length 8 [2020-06-22 09:12:14,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:12:14,272 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 23 transitions. [2020-06-22 09:12:14,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 09:12:14,272 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 23 transitions. [2020-06-22 09:12:14,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 09:12:14,272 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:12:14,272 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:12:14,273 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 09:12:14,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:12:14,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1022043602, now seen corresponding path program 1 times [2020-06-22 09:12:14,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:12:14,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:12:14,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:14,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:12:14,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:12:14,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:12:14,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:12:14,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 09:12:14,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 09:12:14,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 09:12:14,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-06-22 09:12:14,359 INFO L87 Difference]: Start difference. First operand 14 states and 23 transitions. Second operand 6 states. [2020-06-22 09:12:14,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:12:14,473 INFO L93 Difference]: Finished difference Result 16 states and 25 transitions. [2020-06-22 09:12:14,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 09:12:14,474 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-06-22 09:12:14,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:12:14,474 INFO L225 Difference]: With dead ends: 16 [2020-06-22 09:12:14,475 INFO L226 Difference]: Without dead ends: 15 [2020-06-22 09:12:14,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-06-22 09:12:14,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-06-22 09:12:14,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2020-06-22 09:12:14,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 09:12:14,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 22 transitions. [2020-06-22 09:12:14,478 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 22 transitions. Word has length 8 [2020-06-22 09:12:14,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:12:14,478 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 22 transitions. [2020-06-22 09:12:14,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 09:12:14,479 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 22 transitions. [2020-06-22 09:12:14,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 09:12:14,479 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:12:14,479 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:12:14,479 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 09:12:14,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:12:14,480 INFO L82 PathProgramCache]: Analyzing trace with hash 676663114, now seen corresponding path program 1 times [2020-06-22 09:12:14,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:12:14,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:12:14,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:14,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:12:14,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:12:14,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:12:14,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:12:14,562 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:12:14,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:12:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:12:14,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:12:14,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:12:14,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:12:14,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:12:14,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-06-22 09:12:14,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 09:12:14,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 09:12:14,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-06-22 09:12:14,667 INFO L87 Difference]: Start difference. First operand 14 states and 22 transitions. Second operand 8 states. [2020-06-22 09:12:14,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:12:14,789 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. [2020-06-22 09:12:14,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 09:12:14,789 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2020-06-22 09:12:14,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:12:14,790 INFO L225 Difference]: With dead ends: 16 [2020-06-22 09:12:14,790 INFO L226 Difference]: Without dead ends: 15 [2020-06-22 09:12:14,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-06-22 09:12:14,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-06-22 09:12:14,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2020-06-22 09:12:14,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 09:12:14,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2020-06-22 09:12:14,794 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 21 transitions. Word has length 11 [2020-06-22 09:12:14,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:12:14,794 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 21 transitions. [2020-06-22 09:12:14,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 09:12:14,794 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 21 transitions. [2020-06-22 09:12:14,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 09:12:14,795 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:12:14,795 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:12:14,795 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 09:12:14,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:12:14,796 INFO L82 PathProgramCache]: Analyzing trace with hash 676663113, now seen corresponding path program 1 times [2020-06-22 09:12:14,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:12:14,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:12:14,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:14,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:12:14,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:12:14,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:12:14,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:12:14,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-06-22 09:12:14,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 09:12:14,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 09:12:14,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-06-22 09:12:14,898 INFO L87 Difference]: Start difference. First operand 14 states and 21 transitions. Second operand 7 states. [2020-06-22 09:12:15,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:12:15,010 INFO L93 Difference]: Finished difference Result 26 states and 39 transitions. [2020-06-22 09:12:15,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 09:12:15,011 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-06-22 09:12:15,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:12:15,011 INFO L225 Difference]: With dead ends: 26 [2020-06-22 09:12:15,012 INFO L226 Difference]: Without dead ends: 14 [2020-06-22 09:12:15,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-06-22 09:12:15,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-06-22 09:12:15,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-06-22 09:12:15,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 09:12:15,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2020-06-22 09:12:15,015 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 20 transitions. Word has length 11 [2020-06-22 09:12:15,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:12:15,015 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 20 transitions. [2020-06-22 09:12:15,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 09:12:15,016 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 20 transitions. [2020-06-22 09:12:15,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 09:12:15,016 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:12:15,016 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:12:15,016 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 09:12:15,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:12:15,017 INFO L82 PathProgramCache]: Analyzing trace with hash 247428961, now seen corresponding path program 1 times [2020-06-22 09:12:15,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:12:15,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:12:15,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:15,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:12:15,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:12:15,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:12:15,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:12:15,198 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:12:15,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:12:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:12:15,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 26 conjunts are in the unsatisfiable core [2020-06-22 09:12:15,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:12:15,290 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-06-22 09:12:15,290 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:12:15,311 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:12:15,312 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 09:12:15,312 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2020-06-22 09:12:15,387 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:12:15,387 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2020-06-22 09:12:15,391 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:12:15,405 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:12:15,411 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 09:12:15,411 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:23 [2020-06-22 09:12:15,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:12:15,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:12:15,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2020-06-22 09:12:15,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-06-22 09:12:15,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-06-22 09:12:15,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-06-22 09:12:15,474 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. Second operand 12 states. [2020-06-22 09:12:15,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:12:15,987 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-06-22 09:12:15,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 09:12:15,988 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2020-06-22 09:12:15,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:12:15,988 INFO L225 Difference]: With dead ends: 18 [2020-06-22 09:12:15,988 INFO L226 Difference]: Without dead ends: 17 [2020-06-22 09:12:15,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2020-06-22 09:12:15,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-06-22 09:12:15,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-06-22 09:12:15,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 09:12:15,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2020-06-22 09:12:15,993 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 11 [2020-06-22 09:12:15,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:12:15,993 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-06-22 09:12:15,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-06-22 09:12:15,993 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2020-06-22 09:12:15,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 09:12:15,994 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:12:15,994 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:12:15,994 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 09:12:15,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:12:15,995 INFO L82 PathProgramCache]: Analyzing trace with hash -919637632, now seen corresponding path program 1 times [2020-06-22 09:12:15,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:12:15,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:12:15,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:15,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:12:15,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:12:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:12:16,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:12:16,047 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:12:16,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:12:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:12:16,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:12:16,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:12:16,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:12:16,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:12:16,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-06-22 09:12:16,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 09:12:16,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 09:12:16,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-06-22 09:12:16,134 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. Second operand 8 states. [2020-06-22 09:12:16,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:12:16,242 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2020-06-22 09:12:16,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 09:12:16,242 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-06-22 09:12:16,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:12:16,243 INFO L225 Difference]: With dead ends: 18 [2020-06-22 09:12:16,243 INFO L226 Difference]: Without dead ends: 17 [2020-06-22 09:12:16,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-06-22 09:12:16,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-06-22 09:12:16,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-06-22 09:12:16,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 09:12:16,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2020-06-22 09:12:16,247 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 12 [2020-06-22 09:12:16,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:12:16,247 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-06-22 09:12:16,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 09:12:16,248 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2020-06-22 09:12:16,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 09:12:16,248 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:12:16,248 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:12:16,248 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 09:12:16,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:12:16,249 INFO L82 PathProgramCache]: Analyzing trace with hash -919637631, now seen corresponding path program 1 times [2020-06-22 09:12:16,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:12:16,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:12:16,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:16,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:12:16,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:12:16,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:12:16,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:12:16,363 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:12:16,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:12:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:12:16,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 45 conjunts are in the unsatisfiable core [2020-06-22 09:12:16,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:12:16,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:12:16,416 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-06-22 09:12:16,417 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:12:16,432 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:12:16,441 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 09:12:16,441 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:12:16,452 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:12:16,453 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:12:16,453 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:15 [2020-06-22 09:12:16,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:12:16,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:12:16,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2020-06-22 09:12:16,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-06-22 09:12:16,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-06-22 09:12:16,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2020-06-22 09:12:16,622 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand 15 states. [2020-06-22 09:12:22,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:12:22,502 INFO L93 Difference]: Finished difference Result 19 states and 27 transitions. [2020-06-22 09:12:22,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-06-22 09:12:22,503 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 12 [2020-06-22 09:12:22,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:12:22,504 INFO L225 Difference]: With dead ends: 19 [2020-06-22 09:12:22,504 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 09:12:22,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2020-06-22 09:12:22,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 09:12:22,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2020-06-22 09:12:22,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 09:12:22,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2020-06-22 09:12:22,509 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 12 [2020-06-22 09:12:22,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:12:22,509 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-06-22 09:12:22,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-06-22 09:12:22,510 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2020-06-22 09:12:22,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 09:12:22,511 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:12:22,511 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-06-22 09:12:22,511 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 09:12:22,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:12:22,512 INFO L82 PathProgramCache]: Analyzing trace with hash 670593338, now seen corresponding path program 2 times [2020-06-22 09:12:22,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:12:22,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:12:22,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:22,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:12:22,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:12:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:12:22,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:12:22,773 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:12:22,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 09:12:22,819 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 09:12:22,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 09:12:22,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 42 conjunts are in the unsatisfiable core [2020-06-22 09:12:22,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:12:22,841 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 09:12:22,842 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:12:22,849 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:12:22,854 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-06-22 09:12:22,854 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:12:22,862 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:12:22,863 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:12:22,863 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2020-06-22 09:12:22,892 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 09:12:22,893 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:12:22,902 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:12:22,903 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 09:12:22,903 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2020-06-22 09:12:22,982 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2020-06-22 09:12:22,983 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:12:22,993 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:12:22,995 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 09:12:22,995 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:19 [2020-06-22 09:12:23,077 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:12:23,078 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2020-06-22 09:12:23,079 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:12:23,094 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:12:23,097 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 09:12:23,097 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:23 [2020-06-22 09:12:23,149 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:12:23,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:12:23,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-06-22 09:12:23,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-06-22 09:12:23,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-06-22 09:12:23,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-06-22 09:12:23,178 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 17 states. [2020-06-22 09:12:24,263 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2020-06-22 09:12:24,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:12:24,296 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-06-22 09:12:24,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-06-22 09:12:24,297 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2020-06-22 09:12:24,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:12:24,297 INFO L225 Difference]: With dead ends: 18 [2020-06-22 09:12:24,297 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 09:12:24,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2020-06-22 09:12:24,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 09:12:24,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 09:12:24,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 09:12:24,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 09:12:24,300 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2020-06-22 09:12:24,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:12:24,300 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:12:24,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-06-22 09:12:24,300 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:12:24,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 09:12:24,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 09:12:24,869 WARN L188 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2020-06-22 09:12:24,872 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:12:24,872 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:12:24,872 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-06-22 09:12:24,873 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:12:24,873 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 09:12:24,873 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2020-06-22 09:12:24,873 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-06-22 09:12:24,873 INFO L448 ceAbstractionStarter]: For program point L22-1(lines 16 31) no Hoare annotation was computed. [2020-06-22 09:12:24,873 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 21) no Hoare annotation was computed. [2020-06-22 09:12:24,873 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:12:24,873 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 16 31) no Hoare annotation was computed. [2020-06-22 09:12:24,891 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-06-22 09:12:24,891 INFO L448 ceAbstractionStarter]: For program point L10-2(line 10) no Hoare annotation was computed. [2020-06-22 09:12:24,891 INFO L448 ceAbstractionStarter]: For program point L10-3(lines 10 11) no Hoare annotation was computed. [2020-06-22 09:12:24,892 INFO L444 ceAbstractionStarter]: At program point L10-5(lines 10 11) the Hoare annotation is: (let ((.cse5 (select |#length| ULTIMATE.start_main_~nondetArea~0.base))) (let ((.cse8 (= ULTIMATE.start_cstrcpy_~src~0.offset 0)) (.cse11 (= ULTIMATE.start_cstrcpy_~dst~0.offset 0)) (.cse13 (not (= ULTIMATE.start_main_~nondetString~0.base ULTIMATE.start_main_~nondetArea~0.base))) (.cse0 (= 1 (select |#valid| ULTIMATE.start_cstrcpy_~dst~0.base))) (.cse1 (= (select |#valid| ULTIMATE.start_cstrcpy_~src~0.base) 1)) (.cse2 (= ULTIMATE.start_main_~nondetArea~0.offset 0)) (.cse4 (= (select |#valid| ULTIMATE.start_main_~nondetArea~0.base) 1)) (.cse14 (exists ((ULTIMATE.start_main_~nondetString~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString~0.offset 0) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcpy_~src~0.base) (+ (select |#length| ULTIMATE.start_cstrcpy_~src~0.base) ULTIMATE.start_main_~nondetString~0.offset (- 1)))) (<= 0 ULTIMATE.start_main_~nondetString~0.offset)))) (.cse6 (select |#length| ULTIMATE.start_cstrcpy_~dst~0.base)) (.cse15 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse7 (= ULTIMATE.start_main_~nondetString~0.offset 0)) (.cse16 (not (= ULTIMATE.start_cstrcpy_~src~0.base ULTIMATE.start_cstrcpy_~dst~0.base))) (.cse3 (select |#length| ULTIMATE.start_cstrcpy_~src~0.base)) (.cse9 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse10 (= (select |#valid| ULTIMATE.start_main_~nondetString~0.base) 1)) (.cse17 (<= ULTIMATE.start_main_~length2~0 .cse5)) (.cse12 (= ULTIMATE.start_main_~length2~0 (select |#length| ULTIMATE.start_main_~nondetString~0.base)))) (or (and .cse0 .cse1 .cse2 (<= 1 .cse3) .cse4 (<= 1 .cse5) (<= 1 .cse6) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcpy_~src~0.base) ULTIMATE.start_cstrcpy_~src~0.offset)) .cse7 .cse8 .cse9 (= (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString~0.offset) 1) .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse2 .cse4 .cse14 .cse15 .cse7 .cse8 .cse16 .cse9 .cse10 .cse17 .cse11 (<= .cse3 .cse6) .cse12 (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcpy_~src~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString~0.offset (- 1)))) (<= (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString~0.offset) (select |#length| ULTIMATE.start_cstrcpy_~src~0.base)) (<= ULTIMATE.start_cstrcpy_~src~0.offset ULTIMATE.start_main_~nondetString~0.offset) (<= 1 ULTIMATE.start_main_~length2~0)))) (and .cse13 .cse0 .cse1 .cse2 (<= 1 ULTIMATE.start_cstrcpy_~src~0.offset) .cse4 .cse14 (<= (+ .cse3 ULTIMATE.start_cstrcpy_~dst~0.offset) (+ ULTIMATE.start_cstrcpy_~src~0.offset .cse6)) .cse15 .cse7 .cse16 (<= (+ ULTIMATE.start_cstrcpy_~src~0.offset 1) .cse3) (<= 1 ULTIMATE.start_cstrcpy_~dst~0.offset) .cse9 .cse10 .cse17 .cse12)))) [2020-06-22 09:12:24,893 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 09:12:24,903 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:24,905 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:24,905 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:24,905 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 09:12:24,906 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:24,906 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 09:12:24,906 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:24,906 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:24,906 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 09:12:24,907 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:24,907 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:24,907 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:24,912 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,912 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:12:24,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:12:24,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,915 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,915 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,915 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,915 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:12:24,915 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,916 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:12:24,916 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,916 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,916 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,917 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,917 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,917 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,926 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:24,927 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:24,927 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:24,928 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 09:12:24,928 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:24,928 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 09:12:24,928 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:24,928 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:24,929 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 09:12:24,929 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:24,929 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:24,929 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:24,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:12:24,933 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,933 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:12:24,933 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,934 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,934 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,934 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,934 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,934 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:12:24,935 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,935 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:12:24,935 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,935 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,936 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,936 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,936 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,936 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:24,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:12:24 BasicIcfg [2020-06-22 09:12:24,939 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 09:12:24,940 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 09:12:24,940 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 09:12:24,944 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 09:12:24,945 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:12:24,945 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 09:12:11" (1/5) ... [2020-06-22 09:12:24,945 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4018ba44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:12:24, skipping insertion in model container [2020-06-22 09:12:24,946 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:12:24,946 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:12:12" (2/5) ... [2020-06-22 09:12:24,946 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4018ba44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:12:24, skipping insertion in model container [2020-06-22 09:12:24,946 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:12:24,946 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:12:12" (3/5) ... [2020-06-22 09:12:24,946 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4018ba44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:12:24, skipping insertion in model container [2020-06-22 09:12:24,947 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:12:24,947 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:12:12" (4/5) ... [2020-06-22 09:12:24,947 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4018ba44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:12:24, skipping insertion in model container [2020-06-22 09:12:24,947 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:12:24,947 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:12:24" (5/5) ... [2020-06-22 09:12:24,949 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:12:24,972 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:12:24,973 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 09:12:24,973 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 09:12:24,973 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:12:24,973 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:12:24,973 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:12:24,973 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 09:12:24,973 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:12:24,973 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 09:12:24,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-06-22 09:12:24,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 09:12:24,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:12:24,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:12:24,986 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 09:12:24,986 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 09:12:24,986 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 09:12:24,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-06-22 09:12:24,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 09:12:24,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:12:24,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:12:24,988 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 09:12:24,988 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 09:12:24,994 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue [103] ULTIMATE.startENTRY-->L19: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_16| 0 0) |v_#valid_15|)) InVars {#valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~ret7.base=|v_ULTIMATE.start_main_#t~ret7.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_9, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret7.offset=|v_ULTIMATE.start_main_#t~ret7.offset_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_15|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret7.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, #NULL.base, ULTIMATE.start_main_#t~ret7.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc5.offset] 11#L19true [62] L19-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~length1~0_4 1) (< v_ULTIMATE.start_main_~length1~0_5 1)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_5} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length1~0] 5#L19-2true [76] L19-2-->L22-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 15#L22-1true [88] L22-1-->L28: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc5.base_2| 1))) (and (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc6.base_2| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc5.base_2| v_ULTIMATE.start_main_~length1~0_8) |v_ULTIMATE.start_main_#t~malloc6.base_2| v_ULTIMATE.start_main_~length2~0_8)) (> |v_ULTIMATE.start_main_#t~malloc5.base_2| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (>= v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~length2~0_8) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc5.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_8, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, #valid, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~malloc5.base, #length, ULTIMATE.start_main_#t~malloc5.offset] 7#L28true [105] L28-->L10-5: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length2~0_12))) (and (<= 1 .cse0) (= v_ULTIMATE.start_main_~nondetString~0.offset_7 |v_ULTIMATE.start_cstrcpy_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrcpy_~src~0.base_5 v_ULTIMATE.start_cstrcpy_~s2.base_3) (= v_ULTIMATE.start_main_~nondetArea~0.offset_5 |v_ULTIMATE.start_cstrcpy_#in~s1.offset_2|) (= v_ULTIMATE.start_cstrcpy_~s2.base_3 |v_ULTIMATE.start_cstrcpy_#in~s2.base_2|) (= v_ULTIMATE.start_cstrcpy_~src~0.offset_5 v_ULTIMATE.start_cstrcpy_~s2.offset_3) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstrcpy_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrcpy_#in~s1.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= .cse0 (select |v_#length_10| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_cstrcpy_~s1.base_4 |v_ULTIMATE.start_cstrcpy_#in~s1.base_2|) (= v_ULTIMATE.start_cstrcpy_~s1.offset_4 |v_ULTIMATE.start_cstrcpy_#in~s1.offset_2|) (= v_ULTIMATE.start_cstrcpy_~dst~0.offset_5 v_ULTIMATE.start_cstrcpy_~s1.offset_4) (= v_ULTIMATE.start_cstrcpy_~s1.base_4 v_ULTIMATE.start_cstrcpy_~dst~0.base_5) (= v_ULTIMATE.start_cstrcpy_~s2.offset_3 |v_ULTIMATE.start_cstrcpy_#in~s2.offset_2|) (= |v_#memory_int_6| (store |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length2~0_12 (- 1)) 0))))) InVars {ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, #memory_int=|v_#memory_int_7|, #length=|v_#length_10|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_12} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_8|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrcpy_~src~0.base=v_ULTIMATE.start_cstrcpy_~src~0.base_5, ULTIMATE.start_cstrcpy_#t~post1.offset=|v_ULTIMATE.start_cstrcpy_#t~post1.offset_7|, ULTIMATE.start_cstrcpy_#t~post0.offset=|v_ULTIMATE.start_cstrcpy_#t~post0.offset_7|, ULTIMATE.start_cstrcpy_~dst~0.offset=v_ULTIMATE.start_cstrcpy_~dst~0.offset_5, #length=|v_#length_10|, ULTIMATE.start_cstrcpy_~s1.offset=v_ULTIMATE.start_cstrcpy_~s1.offset_4, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_12, ULTIMATE.start_cstrcpy_#in~s2.base=|v_ULTIMATE.start_cstrcpy_#in~s2.base_2|, ULTIMATE.start_cstrcpy_~s2.base=v_ULTIMATE.start_cstrcpy_~s2.base_3, ULTIMATE.start_cstrcpy_~s1.base=v_ULTIMATE.start_cstrcpy_~s1.base_4, ULTIMATE.start_cstrcpy_#in~s1.offset=|v_ULTIMATE.start_cstrcpy_#in~s1.offset_2|, ULTIMATE.start_cstrcpy_~src~0.offset=v_ULTIMATE.start_cstrcpy_~src~0.offset_5, ULTIMATE.start_cstrcpy_#res.base=|v_ULTIMATE.start_cstrcpy_#res.base_4|, ULTIMATE.start_cstrcpy_~s2.offset=v_ULTIMATE.start_cstrcpy_~s2.offset_3, ULTIMATE.start_cstrcpy_~dst~0.base=v_ULTIMATE.start_cstrcpy_~dst~0.base_5, ULTIMATE.start_cstrcpy_#in~s1.base=|v_ULTIMATE.start_cstrcpy_#in~s1.base_2|, ULTIMATE.start_cstrcpy_#res.offset=|v_ULTIMATE.start_cstrcpy_#res.offset_4|, ULTIMATE.start_cstrcpy_#t~post0.base=|v_ULTIMATE.start_cstrcpy_#t~post0.base_8|, ULTIMATE.start_cstrcpy_#t~post1.base=|v_ULTIMATE.start_cstrcpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrcpy_#in~s2.offset=|v_ULTIMATE.start_cstrcpy_#in~s2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~mem2, ULTIMATE.start_cstrcpy_#in~s2.base, ULTIMATE.start_cstrcpy_~s2.base, ULTIMATE.start_cstrcpy_~s1.base, ULTIMATE.start_cstrcpy_#in~s1.offset, ULTIMATE.start_cstrcpy_~src~0.offset, ULTIMATE.start_cstrcpy_#res.base, ULTIMATE.start_cstrcpy_~src~0.base, ULTIMATE.start_cstrcpy_~s2.offset, ULTIMATE.start_cstrcpy_#t~post1.offset, ULTIMATE.start_cstrcpy_~dst~0.base, ULTIMATE.start_cstrcpy_#in~s1.base, ULTIMATE.start_cstrcpy_#res.offset, ULTIMATE.start_cstrcpy_#t~post0.offset, ULTIMATE.start_cstrcpy_#t~post0.base, ULTIMATE.start_cstrcpy_#t~post1.base, #memory_int, ULTIMATE.start_cstrcpy_~dst~0.offset, ULTIMATE.start_cstrcpy_~s1.offset, ULTIMATE.start_cstrcpy_#in~s2.offset] 4#L10-5true [2020-06-22 09:12:24,995 INFO L796 eck$LassoCheckResult]: Loop: 4#L10-5true [50] L10-5-->L10-1: Formula: (and (= v_ULTIMATE.start_cstrcpy_~dst~0.base_3 |v_ULTIMATE.start_cstrcpy_#t~post0.base_2|) (= v_ULTIMATE.start_cstrcpy_~src~0.base_3 |v_ULTIMATE.start_cstrcpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrcpy_#t~post0.offset_2| v_ULTIMATE.start_cstrcpy_~dst~0.offset_4) (= v_ULTIMATE.start_cstrcpy_~src~0.offset_3 (+ |v_ULTIMATE.start_cstrcpy_#t~post1.offset_2| 1)) (= v_ULTIMATE.start_cstrcpy_~dst~0.offset_3 (+ |v_ULTIMATE.start_cstrcpy_#t~post0.offset_2| 1)) (= |v_ULTIMATE.start_cstrcpy_#t~post1.base_2| v_ULTIMATE.start_cstrcpy_~src~0.base_4) (= |v_ULTIMATE.start_cstrcpy_#t~post0.base_2| v_ULTIMATE.start_cstrcpy_~dst~0.base_4) (= |v_ULTIMATE.start_cstrcpy_#t~post1.offset_2| v_ULTIMATE.start_cstrcpy_~src~0.offset_4)) InVars {ULTIMATE.start_cstrcpy_~src~0.offset=v_ULTIMATE.start_cstrcpy_~src~0.offset_4, ULTIMATE.start_cstrcpy_~dst~0.offset=v_ULTIMATE.start_cstrcpy_~dst~0.offset_4, ULTIMATE.start_cstrcpy_~src~0.base=v_ULTIMATE.start_cstrcpy_~src~0.base_4, ULTIMATE.start_cstrcpy_~dst~0.base=v_ULTIMATE.start_cstrcpy_~dst~0.base_4} OutVars{ULTIMATE.start_cstrcpy_#t~post0.offset=|v_ULTIMATE.start_cstrcpy_#t~post0.offset_2|, ULTIMATE.start_cstrcpy_#t~post0.base=|v_ULTIMATE.start_cstrcpy_#t~post0.base_2|, ULTIMATE.start_cstrcpy_#t~post1.base=|v_ULTIMATE.start_cstrcpy_#t~post1.base_2|, ULTIMATE.start_cstrcpy_~src~0.offset=v_ULTIMATE.start_cstrcpy_~src~0.offset_3, ULTIMATE.start_cstrcpy_~dst~0.offset=v_ULTIMATE.start_cstrcpy_~dst~0.offset_3, ULTIMATE.start_cstrcpy_~src~0.base=v_ULTIMATE.start_cstrcpy_~src~0.base_3, ULTIMATE.start_cstrcpy_#t~post1.offset=|v_ULTIMATE.start_cstrcpy_#t~post1.offset_2|, ULTIMATE.start_cstrcpy_~dst~0.base=v_ULTIMATE.start_cstrcpy_~dst~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~post0.offset, ULTIMATE.start_cstrcpy_#t~post0.base, ULTIMATE.start_cstrcpy_#t~post1.base, ULTIMATE.start_cstrcpy_~src~0.offset, ULTIMATE.start_cstrcpy_~dst~0.offset, ULTIMATE.start_cstrcpy_~src~0.base, ULTIMATE.start_cstrcpy_#t~post1.offset, ULTIMATE.start_cstrcpy_~dst~0.base] 13#L10-1true [65] L10-1-->L10-2: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_cstrcpy_#t~post1.base_3|) 1) (= |v_ULTIMATE.start_cstrcpy_#t~mem2_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrcpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrcpy_#t~post1.offset_3|)) (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post1.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrcpy_#t~post1.base_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrcpy_#t~post1.offset=|v_ULTIMATE.start_cstrcpy_#t~post1.offset_3|, ULTIMATE.start_cstrcpy_#t~post1.base=|v_ULTIMATE.start_cstrcpy_#t~post1.base_3|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_2|, ULTIMATE.start_cstrcpy_#t~post1.base=|v_ULTIMATE.start_cstrcpy_#t~post1.base_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrcpy_#t~post1.offset=|v_ULTIMATE.start_cstrcpy_#t~post1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~mem2] 10#L10-2true [59] L10-2-->L10-3: Formula: (and (= 1 (select |v_#valid_10| |v_ULTIMATE.start_cstrcpy_#t~post0.base_3|)) (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post0.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrcpy_#t~post0.base_3|)) (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post0.offset_3|) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrcpy_#t~post0.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrcpy_#t~post0.base_3|) |v_ULTIMATE.start_cstrcpy_#t~post0.offset_3| |v_ULTIMATE.start_cstrcpy_#t~mem2_3|)) |v_#memory_int_4|)) InVars {ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_3|, ULTIMATE.start_cstrcpy_#t~post0.offset=|v_ULTIMATE.start_cstrcpy_#t~post0.offset_3|, ULTIMATE.start_cstrcpy_#t~post0.base=|v_ULTIMATE.start_cstrcpy_#t~post0.base_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_3|, ULTIMATE.start_cstrcpy_#t~post0.offset=|v_ULTIMATE.start_cstrcpy_#t~post0.offset_3|, ULTIMATE.start_cstrcpy_#t~post0.base=|v_ULTIMATE.start_cstrcpy_#t~post0.base_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 8#L10-3true [101] L10-3-->L10-5: Formula: (< |v_ULTIMATE.start_cstrcpy_#t~mem2_7| 0) InVars {ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_7|} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_6|, ULTIMATE.start_cstrcpy_#t~post0.offset=|v_ULTIMATE.start_cstrcpy_#t~post0.offset_6|, ULTIMATE.start_cstrcpy_#t~post0.base=|v_ULTIMATE.start_cstrcpy_#t~post0.base_7|, ULTIMATE.start_cstrcpy_#t~post1.offset=|v_ULTIMATE.start_cstrcpy_#t~post1.offset_6|, ULTIMATE.start_cstrcpy_#t~post1.base=|v_ULTIMATE.start_cstrcpy_#t~post1.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~mem2, ULTIMATE.start_cstrcpy_#t~post0.offset, ULTIMATE.start_cstrcpy_#t~post0.base, ULTIMATE.start_cstrcpy_#t~post1.base, ULTIMATE.start_cstrcpy_#t~post1.offset] 4#L10-5true [2020-06-22 09:12:24,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:12:24,996 INFO L82 PathProgramCache]: Analyzing trace with hash 125674725, now seen corresponding path program 1 times [2020-06-22 09:12:24,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:12:24,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:12:24,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:24,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:12:24,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:12:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:12:25,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:12:25,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2477466, now seen corresponding path program 1 times [2020-06-22 09:12:25,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:12:25,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:12:25,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:25,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:12:25,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:12:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:12:25,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:12:25,040 INFO L82 PathProgramCache]: Analyzing trace with hash 348020862, now seen corresponding path program 1 times [2020-06-22 09:12:25,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:12:25,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:12:25,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:25,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:12:25,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:12:25,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:12:25,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:12:25,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-06-22 09:12:25,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 09:12:25,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-06-22 09:12:25,222 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 8 states. [2020-06-22 09:12:25,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:12:25,479 INFO L93 Difference]: Finished difference Result 28 states and 48 transitions. [2020-06-22 09:12:25,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 09:12:25,482 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 48 transitions. [2020-06-22 09:12:25,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 09:12:25,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 9 states and 14 transitions. [2020-06-22 09:12:25,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-06-22 09:12:25,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-06-22 09:12:25,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 14 transitions. [2020-06-22 09:12:25,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:12:25,487 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2020-06-22 09:12:25,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 14 transitions. [2020-06-22 09:12:25,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-06-22 09:12:25,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 09:12:25,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2020-06-22 09:12:25,490 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2020-06-22 09:12:25,490 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2020-06-22 09:12:25,490 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 09:12:25,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 14 transitions. [2020-06-22 09:12:25,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 09:12:25,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:12:25,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:12:25,491 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 09:12:25,491 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 09:12:25,492 INFO L794 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRY [103] ULTIMATE.startENTRY-->L19: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_16| 0 0) |v_#valid_15|)) InVars {#valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~ret7.base=|v_ULTIMATE.start_main_#t~ret7.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_9, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret7.offset=|v_ULTIMATE.start_main_#t~ret7.offset_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_15|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret7.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, #NULL.base, ULTIMATE.start_main_#t~ret7.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc5.offset] 72#L19 [75] L19-->L19-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 73#L19-2 [76] L19-2-->L22-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 67#L22-1 [88] L22-1-->L28: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc5.base_2| 1))) (and (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc6.base_2| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc5.base_2| v_ULTIMATE.start_main_~length1~0_8) |v_ULTIMATE.start_main_#t~malloc6.base_2| v_ULTIMATE.start_main_~length2~0_8)) (> |v_ULTIMATE.start_main_#t~malloc5.base_2| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (>= v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~length2~0_8) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc5.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_8, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, #valid, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~malloc5.base, #length, ULTIMATE.start_main_#t~malloc5.offset] 68#L28 [105] L28-->L10-5: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length2~0_12))) (and (<= 1 .cse0) (= v_ULTIMATE.start_main_~nondetString~0.offset_7 |v_ULTIMATE.start_cstrcpy_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrcpy_~src~0.base_5 v_ULTIMATE.start_cstrcpy_~s2.base_3) (= v_ULTIMATE.start_main_~nondetArea~0.offset_5 |v_ULTIMATE.start_cstrcpy_#in~s1.offset_2|) (= v_ULTIMATE.start_cstrcpy_~s2.base_3 |v_ULTIMATE.start_cstrcpy_#in~s2.base_2|) (= v_ULTIMATE.start_cstrcpy_~src~0.offset_5 v_ULTIMATE.start_cstrcpy_~s2.offset_3) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstrcpy_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrcpy_#in~s1.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= .cse0 (select |v_#length_10| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_cstrcpy_~s1.base_4 |v_ULTIMATE.start_cstrcpy_#in~s1.base_2|) (= v_ULTIMATE.start_cstrcpy_~s1.offset_4 |v_ULTIMATE.start_cstrcpy_#in~s1.offset_2|) (= v_ULTIMATE.start_cstrcpy_~dst~0.offset_5 v_ULTIMATE.start_cstrcpy_~s1.offset_4) (= v_ULTIMATE.start_cstrcpy_~s1.base_4 v_ULTIMATE.start_cstrcpy_~dst~0.base_5) (= v_ULTIMATE.start_cstrcpy_~s2.offset_3 |v_ULTIMATE.start_cstrcpy_#in~s2.offset_2|) (= |v_#memory_int_6| (store |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length2~0_12 (- 1)) 0))))) InVars {ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, #memory_int=|v_#memory_int_7|, #length=|v_#length_10|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_12} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_8|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrcpy_~src~0.base=v_ULTIMATE.start_cstrcpy_~src~0.base_5, ULTIMATE.start_cstrcpy_#t~post1.offset=|v_ULTIMATE.start_cstrcpy_#t~post1.offset_7|, ULTIMATE.start_cstrcpy_#t~post0.offset=|v_ULTIMATE.start_cstrcpy_#t~post0.offset_7|, ULTIMATE.start_cstrcpy_~dst~0.offset=v_ULTIMATE.start_cstrcpy_~dst~0.offset_5, #length=|v_#length_10|, ULTIMATE.start_cstrcpy_~s1.offset=v_ULTIMATE.start_cstrcpy_~s1.offset_4, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_12, ULTIMATE.start_cstrcpy_#in~s2.base=|v_ULTIMATE.start_cstrcpy_#in~s2.base_2|, ULTIMATE.start_cstrcpy_~s2.base=v_ULTIMATE.start_cstrcpy_~s2.base_3, ULTIMATE.start_cstrcpy_~s1.base=v_ULTIMATE.start_cstrcpy_~s1.base_4, ULTIMATE.start_cstrcpy_#in~s1.offset=|v_ULTIMATE.start_cstrcpy_#in~s1.offset_2|, ULTIMATE.start_cstrcpy_~src~0.offset=v_ULTIMATE.start_cstrcpy_~src~0.offset_5, ULTIMATE.start_cstrcpy_#res.base=|v_ULTIMATE.start_cstrcpy_#res.base_4|, ULTIMATE.start_cstrcpy_~s2.offset=v_ULTIMATE.start_cstrcpy_~s2.offset_3, ULTIMATE.start_cstrcpy_~dst~0.base=v_ULTIMATE.start_cstrcpy_~dst~0.base_5, ULTIMATE.start_cstrcpy_#in~s1.base=|v_ULTIMATE.start_cstrcpy_#in~s1.base_2|, ULTIMATE.start_cstrcpy_#res.offset=|v_ULTIMATE.start_cstrcpy_#res.offset_4|, ULTIMATE.start_cstrcpy_#t~post0.base=|v_ULTIMATE.start_cstrcpy_#t~post0.base_8|, ULTIMATE.start_cstrcpy_#t~post1.base=|v_ULTIMATE.start_cstrcpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrcpy_#in~s2.offset=|v_ULTIMATE.start_cstrcpy_#in~s2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~mem2, ULTIMATE.start_cstrcpy_#in~s2.base, ULTIMATE.start_cstrcpy_~s2.base, ULTIMATE.start_cstrcpy_~s1.base, ULTIMATE.start_cstrcpy_#in~s1.offset, ULTIMATE.start_cstrcpy_~src~0.offset, ULTIMATE.start_cstrcpy_#res.base, ULTIMATE.start_cstrcpy_~src~0.base, ULTIMATE.start_cstrcpy_~s2.offset, ULTIMATE.start_cstrcpy_#t~post1.offset, ULTIMATE.start_cstrcpy_~dst~0.base, ULTIMATE.start_cstrcpy_#in~s1.base, ULTIMATE.start_cstrcpy_#res.offset, ULTIMATE.start_cstrcpy_#t~post0.offset, ULTIMATE.start_cstrcpy_#t~post0.base, ULTIMATE.start_cstrcpy_#t~post1.base, #memory_int, ULTIMATE.start_cstrcpy_~dst~0.offset, ULTIMATE.start_cstrcpy_~s1.offset, ULTIMATE.start_cstrcpy_#in~s2.offset] 69#L10-5 [2020-06-22 09:12:25,492 INFO L796 eck$LassoCheckResult]: Loop: 69#L10-5 [50] L10-5-->L10-1: Formula: (and (= v_ULTIMATE.start_cstrcpy_~dst~0.base_3 |v_ULTIMATE.start_cstrcpy_#t~post0.base_2|) (= v_ULTIMATE.start_cstrcpy_~src~0.base_3 |v_ULTIMATE.start_cstrcpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrcpy_#t~post0.offset_2| v_ULTIMATE.start_cstrcpy_~dst~0.offset_4) (= v_ULTIMATE.start_cstrcpy_~src~0.offset_3 (+ |v_ULTIMATE.start_cstrcpy_#t~post1.offset_2| 1)) (= v_ULTIMATE.start_cstrcpy_~dst~0.offset_3 (+ |v_ULTIMATE.start_cstrcpy_#t~post0.offset_2| 1)) (= |v_ULTIMATE.start_cstrcpy_#t~post1.base_2| v_ULTIMATE.start_cstrcpy_~src~0.base_4) (= |v_ULTIMATE.start_cstrcpy_#t~post0.base_2| v_ULTIMATE.start_cstrcpy_~dst~0.base_4) (= |v_ULTIMATE.start_cstrcpy_#t~post1.offset_2| v_ULTIMATE.start_cstrcpy_~src~0.offset_4)) InVars {ULTIMATE.start_cstrcpy_~src~0.offset=v_ULTIMATE.start_cstrcpy_~src~0.offset_4, ULTIMATE.start_cstrcpy_~dst~0.offset=v_ULTIMATE.start_cstrcpy_~dst~0.offset_4, ULTIMATE.start_cstrcpy_~src~0.base=v_ULTIMATE.start_cstrcpy_~src~0.base_4, ULTIMATE.start_cstrcpy_~dst~0.base=v_ULTIMATE.start_cstrcpy_~dst~0.base_4} OutVars{ULTIMATE.start_cstrcpy_#t~post0.offset=|v_ULTIMATE.start_cstrcpy_#t~post0.offset_2|, ULTIMATE.start_cstrcpy_#t~post0.base=|v_ULTIMATE.start_cstrcpy_#t~post0.base_2|, ULTIMATE.start_cstrcpy_#t~post1.base=|v_ULTIMATE.start_cstrcpy_#t~post1.base_2|, ULTIMATE.start_cstrcpy_~src~0.offset=v_ULTIMATE.start_cstrcpy_~src~0.offset_3, ULTIMATE.start_cstrcpy_~dst~0.offset=v_ULTIMATE.start_cstrcpy_~dst~0.offset_3, ULTIMATE.start_cstrcpy_~src~0.base=v_ULTIMATE.start_cstrcpy_~src~0.base_3, ULTIMATE.start_cstrcpy_#t~post1.offset=|v_ULTIMATE.start_cstrcpy_#t~post1.offset_2|, ULTIMATE.start_cstrcpy_~dst~0.base=v_ULTIMATE.start_cstrcpy_~dst~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~post0.offset, ULTIMATE.start_cstrcpy_#t~post0.base, ULTIMATE.start_cstrcpy_#t~post1.base, ULTIMATE.start_cstrcpy_~src~0.offset, ULTIMATE.start_cstrcpy_~dst~0.offset, ULTIMATE.start_cstrcpy_~src~0.base, ULTIMATE.start_cstrcpy_#t~post1.offset, ULTIMATE.start_cstrcpy_~dst~0.base] 70#L10-1 [65] L10-1-->L10-2: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_cstrcpy_#t~post1.base_3|) 1) (= |v_ULTIMATE.start_cstrcpy_#t~mem2_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrcpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrcpy_#t~post1.offset_3|)) (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post1.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrcpy_#t~post1.base_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrcpy_#t~post1.offset=|v_ULTIMATE.start_cstrcpy_#t~post1.offset_3|, ULTIMATE.start_cstrcpy_#t~post1.base=|v_ULTIMATE.start_cstrcpy_#t~post1.base_3|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_2|, ULTIMATE.start_cstrcpy_#t~post1.base=|v_ULTIMATE.start_cstrcpy_#t~post1.base_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrcpy_#t~post1.offset=|v_ULTIMATE.start_cstrcpy_#t~post1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~mem2] 75#L10-2 [59] L10-2-->L10-3: Formula: (and (= 1 (select |v_#valid_10| |v_ULTIMATE.start_cstrcpy_#t~post0.base_3|)) (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post0.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrcpy_#t~post0.base_3|)) (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post0.offset_3|) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrcpy_#t~post0.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrcpy_#t~post0.base_3|) |v_ULTIMATE.start_cstrcpy_#t~post0.offset_3| |v_ULTIMATE.start_cstrcpy_#t~mem2_3|)) |v_#memory_int_4|)) InVars {ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_3|, ULTIMATE.start_cstrcpy_#t~post0.offset=|v_ULTIMATE.start_cstrcpy_#t~post0.offset_3|, ULTIMATE.start_cstrcpy_#t~post0.base=|v_ULTIMATE.start_cstrcpy_#t~post0.base_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_3|, ULTIMATE.start_cstrcpy_#t~post0.offset=|v_ULTIMATE.start_cstrcpy_#t~post0.offset_3|, ULTIMATE.start_cstrcpy_#t~post0.base=|v_ULTIMATE.start_cstrcpy_#t~post0.base_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 74#L10-3 [101] L10-3-->L10-5: Formula: (< |v_ULTIMATE.start_cstrcpy_#t~mem2_7| 0) InVars {ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_7|} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_6|, ULTIMATE.start_cstrcpy_#t~post0.offset=|v_ULTIMATE.start_cstrcpy_#t~post0.offset_6|, ULTIMATE.start_cstrcpy_#t~post0.base=|v_ULTIMATE.start_cstrcpy_#t~post0.base_7|, ULTIMATE.start_cstrcpy_#t~post1.offset=|v_ULTIMATE.start_cstrcpy_#t~post1.offset_6|, ULTIMATE.start_cstrcpy_#t~post1.base=|v_ULTIMATE.start_cstrcpy_#t~post1.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~mem2, ULTIMATE.start_cstrcpy_#t~post0.offset, ULTIMATE.start_cstrcpy_#t~post0.base, ULTIMATE.start_cstrcpy_#t~post1.base, ULTIMATE.start_cstrcpy_#t~post1.offset] 69#L10-5 [2020-06-22 09:12:25,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:12:25,493 INFO L82 PathProgramCache]: Analyzing trace with hash 126062008, now seen corresponding path program 1 times [2020-06-22 09:12:25,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:12:25,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:12:25,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:25,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:12:25,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:12:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:12:25,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:12:25,509 INFO L82 PathProgramCache]: Analyzing trace with hash 2477466, now seen corresponding path program 2 times [2020-06-22 09:12:25,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:12:25,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:12:25,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:25,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:12:25,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:12:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:12:25,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:12:25,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1529718737, now seen corresponding path program 1 times [2020-06-22 09:12:25,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:12:25,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:12:25,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:25,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:12:25,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:12:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:12:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:12:25,868 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2020-06-22 09:12:26,001 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-06-22 09:12:26,020 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:12:26,021 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:12:26,022 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:12:26,022 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:12:26,022 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:12:26,022 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:12:26,022 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:12:26,023 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:12:26,023 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 09:12:26,023 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:12:26,023 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:12:26,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:12:26,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:12:26,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:12:26,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:12:26,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:12:26,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:12:26,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:12:26,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:12:26,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:12:26,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:12:26,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:12:26,566 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2020-06-22 09:12:26,780 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2020-06-22 09:12:26,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:12:26,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:12:26,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:12:26,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:12:27,618 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:12:27,627 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:12:27,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:12:27,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:12:27,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:12:27,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:12:27,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:12:27,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:12:27,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:12:27,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:12:27,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:12:27,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:12:27,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:12:27,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:12:27,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:12:27,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:12:27,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:12:27,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:12:27,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:12:27,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:12:27,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:12:27,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:12:27,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:12:27,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:12:27,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:12:27,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:12:27,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:12:27,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:12:27,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:12:27,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:12:27,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:12:27,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:12:27,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:12:27,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:12:27,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:12:27,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:12:27,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:12:27,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:12:27,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:12:27,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:12:27,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:12:27,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:12:27,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:12:27,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:12:27,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:12:27,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:12:27,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:12:27,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:12:27,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:12:27,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:12:27,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:12:27,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:12:27,665 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:12:27,665 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:12:27,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:12:27,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:12:27,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:12:27,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:12:27,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:12:27,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:12:27,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:12:27,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:12:27,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:12:27,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:12:27,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:12:27,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:12:27,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:12:27,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:12:27,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:12:27,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:12:27,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:12:27,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:12:27,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:12:27,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:12:27,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:12:27,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:12:27,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:12:27,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:12:27,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:12:27,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:12:27,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:12:27,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:12:27,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:12:27,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:12:27,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:12:27,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:12:27,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:12:27,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:12:27,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:12:27,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:12:27,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:12:27,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:12:27,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:12:27,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:12:27,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:12:27,688 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:12:27,689 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:12:27,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:12:27,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:12:27,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:12:27,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:12:27,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:12:27,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:12:27,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:12:27,696 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:12:27,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:12:27,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:12:27,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:12:27,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:12:27,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:12:27,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:12:27,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:12:27,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:12:27,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:12:27,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:12:27,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:12:27,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:12:27,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:12:27,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:12:27,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:12:27,707 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:12:27,707 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:12:27,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:12:27,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:12:27,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:12:27,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:12:27,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:12:27,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:12:27,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:12:27,716 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:12:27,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:12:27,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:12:27,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:12:27,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:12:27,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:12:27,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:12:27,726 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:12:27,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:12:27,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:12:27,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:12:27,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:12:27,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:12:27,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:12:27,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:12:27,767 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:12:27,767 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:12:27,809 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:12:27,843 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 09:12:27,843 INFO L444 ModelExtractionUtils]: 35 out of 40 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 09:12:27,845 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:12:27,847 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:12:27,847 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:12:27,848 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc5.base)_1, ULTIMATE.start_cstrcpy_~dst~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc5.base)_1 - 1*ULTIMATE.start_cstrcpy_~dst~0.offset Supporting invariants [] [2020-06-22 09:12:27,888 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2020-06-22 09:12:27,892 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:27,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:12:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:12:27,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 09:12:27,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:12:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:12:27,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 09:12:27,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:12:28,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:12:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:12:28,122 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:12:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:12:28,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 09:12:28,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:12:28,132 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-06-22 09:12:28,136 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2020-06-22 09:12:28,136 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states and 14 transitions. cyclomatic complexity: 6 Second operand 5 states. [2020-06-22 09:12:28,334 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states and 14 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 14 states and 21 transitions. Complement of second has 8 states. [2020-06-22 09:12:28,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 2 accepting loop states [2020-06-22 09:12:28,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 09:12:28,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2020-06-22 09:12:28,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 5 letters. Loop has 4 letters. [2020-06-22 09:12:28,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:12:28,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 9 letters. Loop has 4 letters. [2020-06-22 09:12:28,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:12:28,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 5 letters. Loop has 8 letters. [2020-06-22 09:12:28,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:12:28,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 21 transitions. [2020-06-22 09:12:28,344 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:12:28,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2020-06-22 09:12:28,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 09:12:28,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 09:12:28,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 09:12:28,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:12:28,345 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:12:28,345 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:12:28,345 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:12:28,345 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 09:12:28,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:12:28,346 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:12:28,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 09:12:28,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:12:28 BasicIcfg [2020-06-22 09:12:28,351 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 09:12:28,352 INFO L168 Benchmark]: Toolchain (without parser) took 16412.15 ms. Allocated memory was 649.6 MB in the beginning and 831.5 MB in the end (delta: 181.9 MB). Free memory was 566.3 MB in the beginning and 688.9 MB in the end (delta: -122.6 MB). Peak memory consumption was 59.3 MB. Max. memory is 50.3 GB. [2020-06-22 09:12:28,353 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:12:28,353 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.34 ms. Allocated memory was 649.6 MB in the beginning and 689.4 MB in the end (delta: 39.8 MB). Free memory was 566.3 MB in the beginning and 653.0 MB in the end (delta: -86.8 MB). Peak memory consumption was 28.5 MB. Max. memory is 50.3 GB. [2020-06-22 09:12:28,354 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.09 ms. Allocated memory is still 689.4 MB. Free memory was 651.7 MB in the beginning and 650.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. [2020-06-22 09:12:28,354 INFO L168 Benchmark]: Boogie Preprocessor took 26.28 ms. Allocated memory is still 689.4 MB. Free memory was 650.3 MB in the beginning and 649.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 09:12:28,355 INFO L168 Benchmark]: RCFGBuilder took 324.14 ms. Allocated memory is still 689.4 MB. Free memory was 649.0 MB in the beginning and 628.2 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 50.3 GB. [2020-06-22 09:12:28,355 INFO L168 Benchmark]: BlockEncodingV2 took 129.09 ms. Allocated memory is still 689.4 MB. Free memory was 628.2 MB in the beginning and 620.1 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. [2020-06-22 09:12:28,356 INFO L168 Benchmark]: TraceAbstraction took 12153.32 ms. Allocated memory was 689.4 MB in the beginning and 831.0 MB in the end (delta: 141.6 MB). Free memory was 620.1 MB in the beginning and 780.5 MB in the end (delta: -160.4 MB). Peak memory consumption was 324.4 MB. Max. memory is 50.3 GB. [2020-06-22 09:12:28,356 INFO L168 Benchmark]: BuchiAutomizer took 3411.33 ms. Allocated memory was 831.0 MB in the beginning and 831.5 MB in the end (delta: 524.3 kB). Free memory was 780.5 MB in the beginning and 688.9 MB in the end (delta: 91.5 MB). Peak memory consumption was 92.0 MB. Max. memory is 50.3 GB. [2020-06-22 09:12:28,360 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 22 locations, 26 edges - StatisticsResult: Encoded RCFG 15 locations, 27 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 321.34 ms. Allocated memory was 649.6 MB in the beginning and 689.4 MB in the end (delta: 39.8 MB). Free memory was 566.3 MB in the beginning and 653.0 MB in the end (delta: -86.8 MB). Peak memory consumption was 28.5 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.09 ms. Allocated memory is still 689.4 MB. Free memory was 651.7 MB in the beginning and 650.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 26.28 ms. Allocated memory is still 689.4 MB. Free memory was 650.3 MB in the beginning and 649.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 324.14 ms. Allocated memory is still 689.4 MB. Free memory was 649.0 MB in the beginning and 628.2 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 129.09 ms. Allocated memory is still 689.4 MB. Free memory was 628.2 MB in the beginning and 620.1 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 12153.32 ms. Allocated memory was 689.4 MB in the beginning and 831.0 MB in the end (delta: 141.6 MB). Free memory was 620.1 MB in the beginning and 780.5 MB in the end (delta: -160.4 MB). Peak memory consumption was 324.4 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 3411.33 ms. Allocated memory was 831.0 MB in the beginning and 831.5 MB in the end (delta: 524.3 kB). Free memory was 780.5 MB in the beginning and 688.9 MB in the end (delta: 91.5 MB). Peak memory consumption was 92.0 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 10]: Loop Invariant [2020-06-22 09:12:28,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:28,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:28,371 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:28,371 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 09:12:28,371 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:28,371 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 09:12:28,371 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:28,372 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:28,372 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 09:12:28,372 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:28,372 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:28,372 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:28,374 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,374 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:12:28,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:12:28,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:12:28,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:12:28,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:28,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:28,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:28,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 09:12:28,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:28,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 09:12:28,381 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:28,381 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:28,381 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 09:12:28,381 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:28,381 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:28,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:12:28,383 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,383 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,383 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,383 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:12:28,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:12:28,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:12:28,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:12:28,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,387 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:12:28,387 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((((1 == \valid[dst] && \valid[src] == 1) && nondetArea == 0) && 1 <= unknown-#length-unknown[src]) && \valid[nondetArea] == 1) && 1 <= unknown-#length-unknown[nondetArea]) && 1 <= unknown-#length-unknown[dst]) && 0 == unknown-#memory_int-unknown[src][src]) && nondetString == 0) && src == 0) && 1 <= length1) && length2 + nondetString == 1) && \valid[nondetString] == 1) && dst == 0) && length2 == unknown-#length-unknown[nondetString]) || ((((((((((((((((!(nondetString == nondetArea) && 1 == \valid[dst]) && \valid[src] == 1) && nondetArea == 0) && \valid[nondetArea] == 1) && (\exists ULTIMATE.start_main_~nondetString~0.offset : int :: (ULTIMATE.start_main_~nondetString~0.offset <= 0 && 0 == unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + ULTIMATE.start_main_~nondetString~0.offset + -1]) && 0 <= ULTIMATE.start_main_~nondetString~0.offset)) && 1 <= length2) && nondetString == 0) && src == 0) && !(src == dst)) && 1 <= length1) && \valid[nondetString] == 1) && length2 <= unknown-#length-unknown[nondetArea]) && dst == 0) && unknown-#length-unknown[src] <= unknown-#length-unknown[dst]) && length2 == unknown-#length-unknown[nondetString]) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString~0.offset : int :: ((0 == unknown-#memory_int-unknown[src][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString~0.offset + -1] && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString~0.offset <= unknown-#length-unknown[src]) && src <= ULTIMATE.start_main_~nondetString~0.offset) && 1 <= ULTIMATE.start_main_~length2~0))) || ((((((((((((((((!(nondetString == nondetArea) && 1 == \valid[dst]) && \valid[src] == 1) && nondetArea == 0) && 1 <= src) && \valid[nondetArea] == 1) && (\exists ULTIMATE.start_main_~nondetString~0.offset : int :: (ULTIMATE.start_main_~nondetString~0.offset <= 0 && 0 == unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + ULTIMATE.start_main_~nondetString~0.offset + -1]) && 0 <= ULTIMATE.start_main_~nondetString~0.offset)) && unknown-#length-unknown[src] + dst <= src + unknown-#length-unknown[dst]) && 1 <= length2) && nondetString == 0) && !(src == dst)) && src + 1 <= unknown-#length-unknown[src]) && 1 <= dst) && 1 <= length1) && \valid[nondetString] == 1) && length2 <= unknown-#length-unknown[nondetArea]) && length2 == unknown-#length-unknown[nondetString]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 6 error locations. SAFE Result, 12.0s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 8.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 53 SDtfs, 409 SDslu, 418 SDs, 0 SdLazy, 1003 SolverSat, 177 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 16 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 5 NumberOfFragments, 273 HoareAnnotationTreeSize, 1 FomulaSimplifications, 65 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 214 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 193 NumberOfCodeBlocks, 193 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 173 ConstructedInterpolants, 9 QuantifiedInterpolants, 14298 SizeOfPredicates, 52 NumberOfNonLiveVariables, 572 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 4/38 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#length-unknown[alloca(length1 * sizeof(char))] + -1 * dst and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 9 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13 SDtfs, 96 SDslu, 124 SDs, 0 SdLazy, 238 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital202 mio100 ax100 hnf100 lsp97 ukn91 mio100 lsp41 div100 bol100 ite100 ukn100 eq194 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 09:12:08.423 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 09:12:28.623 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check