YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 08:41:41,368 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 08:41:41,370 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 08:41:41,381 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 08:41:41,381 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 08:41:41,382 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 08:41:41,383 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 08:41:41,385 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 08:41:41,386 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 08:41:41,387 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 08:41:41,388 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 08:41:41,388 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 08:41:41,389 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 08:41:41,390 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 08:41:41,391 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 08:41:41,392 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 08:41:41,392 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 08:41:41,394 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 08:41:41,396 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 08:41:41,397 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 08:41:41,398 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 08:41:41,399 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 08:41:41,401 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 08:41:41,401 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 08:41:41,401 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 08:41:41,402 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 08:41:41,403 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 08:41:41,403 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 08:41:41,404 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 08:41:41,404 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 08:41:41,405 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 08:41:41,406 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 08:41:41,406 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 08:41:41,407 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 08:41:41,407 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 08:41:41,407 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 08:41:41,408 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 08:41:41,409 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 08:41:41,409 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 08:41:41,409 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 08:41:41,424 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 08:41:41,424 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 08:41:41,425 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 08:41:41,425 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 08:41:41,425 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 08:41:41,425 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 08:41:41,426 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 08:41:41,426 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 08:41:41,426 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 08:41:41,426 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 08:41:41,426 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 08:41:41,427 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 08:41:41,427 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 08:41:41,427 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 08:41:41,427 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 08:41:41,427 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 08:41:41,427 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 08:41:41,428 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 08:41:41,428 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 08:41:41,428 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 08:41:41,428 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 08:41:41,428 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 08:41:41,429 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 08:41:41,429 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 08:41:41,429 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 08:41:41,429 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 08:41:41,429 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 08:41:41,430 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 08:41:41,430 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 08:41:41,454 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 08:41:41,467 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 08:41:41,470 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 08:41:41,471 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 08:41:41,472 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 08:41:41,473 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 08:41:41,540 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/545f91e54fa9422186318f833f9963ed/FLAG7564f2b94 [2020-06-22 08:41:41,868 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 08:41:41,869 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 08:41:41,869 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 08:41:41,875 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/545f91e54fa9422186318f833f9963ed/FLAG7564f2b94 [2020-06-22 08:41:42,273 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/545f91e54fa9422186318f833f9963ed [2020-06-22 08:41:42,284 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 08:41:42,286 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 08:41:42,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 08:41:42,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 08:41:42,291 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 08:41:42,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 08:41:42" (1/1) ... [2020-06-22 08:41:42,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c92b259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:41:42, skipping insertion in model container [2020-06-22 08:41:42,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 08:41:42" (1/1) ... [2020-06-22 08:41:42,303 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 08:41:42,320 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 08:41:42,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 08:41:42,560 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 08:41:42,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 08:41:42,595 INFO L195 MainTranslator]: Completed translation [2020-06-22 08:41:42,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:41:42 WrapperNode [2020-06-22 08:41:42,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 08:41:42,596 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 08:41:42,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 08:41:42,597 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 08:41:42,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:41:42" (1/1) ... [2020-06-22 08:41:42,616 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:41:42" (1/1) ... [2020-06-22 08:41:42,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 08:41:42,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 08:41:42,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 08:41:42,639 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 08:41:42,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:41:42" (1/1) ... [2020-06-22 08:41:42,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:41:42" (1/1) ... [2020-06-22 08:41:42,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:41:42" (1/1) ... [2020-06-22 08:41:42,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:41:42" (1/1) ... [2020-06-22 08:41:42,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:41:42" (1/1) ... [2020-06-22 08:41:42,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:41:42" (1/1) ... [2020-06-22 08:41:42,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:41:42" (1/1) ... [2020-06-22 08:41:42,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 08:41:42,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 08:41:42,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 08:41:42,663 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 08:41:42,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:41:42" (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 08:41:42,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 08:41:42,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 08:41:42,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 08:41:42,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 08:41:42,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 08:41:42,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 08:41:43,013 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 08:41:43,013 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 08:41:43,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:41:43 BoogieIcfgContainer [2020-06-22 08:41:43,015 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 08:41:43,015 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 08:41:43,015 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 08:41:43,017 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 08:41:43,018 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:41:43" (1/1) ... [2020-06-22 08:41:43,035 INFO L313 BlockEncoder]: Initial Icfg 41 locations, 43 edges [2020-06-22 08:41:43,036 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 08:41:43,037 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 08:41:43,037 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 08:41:43,038 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 08:41:43,039 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 08:41:43,040 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 08:41:43,040 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 08:41:43,065 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 08:41:43,100 INFO L200 BlockEncoder]: SBE split 21 edges [2020-06-22 08:41:43,106 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 08:41:43,108 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 08:41:43,137 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-06-22 08:41:43,140 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 08:41:43,141 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 08:41:43,141 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 08:41:43,142 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 08:41:43,143 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 08:41:43,143 INFO L313 BlockEncoder]: Encoded RCFG 33 locations, 58 edges [2020-06-22 08:41:43,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:41:43 BasicIcfg [2020-06-22 08:41:43,144 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 08:41:43,144 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 08:41:43,145 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 08:41:43,148 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 08:41:43,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 08:41:42" (1/4) ... [2020-06-22 08:41:43,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be21f21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 08:41:43, skipping insertion in model container [2020-06-22 08:41:43,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:41:42" (2/4) ... [2020-06-22 08:41:43,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be21f21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 08:41:43, skipping insertion in model container [2020-06-22 08:41:43,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:41:43" (3/4) ... [2020-06-22 08:41:43,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be21f21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:41:43, skipping insertion in model container [2020-06-22 08:41:43,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:41:43" (4/4) ... [2020-06-22 08:41:43,152 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 08:41:43,162 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 08:41:43,170 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2020-06-22 08:41:43,186 INFO L257 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2020-06-22 08:41:43,215 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 08:41:43,216 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 08:41:43,216 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 08:41:43,216 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 08:41:43,216 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 08:41:43,216 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 08:41:43,216 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 08:41:43,217 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 08:41:43,217 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 08:41:43,232 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-06-22 08:41:43,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 08:41:43,238 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:41:43,239 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 08:41:43,239 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 08:41:43,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:41:43,244 INFO L82 PathProgramCache]: Analyzing trace with hash 116378, now seen corresponding path program 1 times [2020-06-22 08:41:43,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:41:43,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:41:43,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:41:43,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:41:43,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:41:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:41:43,418 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 08:41:43,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:41:43,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:41:43,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:41:43,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:41:43,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:41:43,441 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2020-06-22 08:41:43,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:41:43,565 INFO L93 Difference]: Finished difference Result 33 states and 58 transitions. [2020-06-22 08:41:43,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:41:43,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 08:41:43,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:41:43,580 INFO L225 Difference]: With dead ends: 33 [2020-06-22 08:41:43,580 INFO L226 Difference]: Without dead ends: 28 [2020-06-22 08:41:43,583 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 08:41:43,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-06-22 08:41:43,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-06-22 08:41:43,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 08:41:43,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 48 transitions. [2020-06-22 08:41:43,623 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 48 transitions. Word has length 3 [2020-06-22 08:41:43,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:41:43,624 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 48 transitions. [2020-06-22 08:41:43,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:41:43,624 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 48 transitions. [2020-06-22 08:41:43,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 08:41:43,625 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:41:43,625 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 08:41:43,625 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 08:41:43,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:41:43,626 INFO L82 PathProgramCache]: Analyzing trace with hash 116379, now seen corresponding path program 1 times [2020-06-22 08:41:43,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:41:43,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:41:43,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:41:43,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:41:43,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:41:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:41:43,649 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 08:41:43,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:41:43,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:41:43,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:41:43,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:41:43,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:41:43,652 INFO L87 Difference]: Start difference. First operand 28 states and 48 transitions. Second operand 3 states. [2020-06-22 08:41:43,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:41:43,728 INFO L93 Difference]: Finished difference Result 33 states and 48 transitions. [2020-06-22 08:41:43,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:41:43,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 08:41:43,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:41:43,729 INFO L225 Difference]: With dead ends: 33 [2020-06-22 08:41:43,729 INFO L226 Difference]: Without dead ends: 28 [2020-06-22 08:41:43,730 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 08:41:43,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-06-22 08:41:43,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-06-22 08:41:43,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 08:41:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 43 transitions. [2020-06-22 08:41:43,735 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 43 transitions. Word has length 3 [2020-06-22 08:41:43,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:41:43,735 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 43 transitions. [2020-06-22 08:41:43,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:41:43,735 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 43 transitions. [2020-06-22 08:41:43,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 08:41:43,736 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:41:43,736 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 08:41:43,736 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 08:41:43,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:41:43,736 INFO L82 PathProgramCache]: Analyzing trace with hash 116380, now seen corresponding path program 1 times [2020-06-22 08:41:43,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:41:43,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:41:43,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:41:43,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:41:43,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:41:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:41:43,770 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 08:41:43,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:41:43,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:41:43,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:41:43,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:41:43,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:41:43,771 INFO L87 Difference]: Start difference. First operand 28 states and 43 transitions. Second operand 3 states. [2020-06-22 08:41:43,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:41:43,861 INFO L93 Difference]: Finished difference Result 28 states and 43 transitions. [2020-06-22 08:41:43,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:41:43,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 08:41:43,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:41:43,863 INFO L225 Difference]: With dead ends: 28 [2020-06-22 08:41:43,863 INFO L226 Difference]: Without dead ends: 22 [2020-06-22 08:41:43,863 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 08:41:43,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-06-22 08:41:43,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-06-22 08:41:43,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 08:41:43,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 37 transitions. [2020-06-22 08:41:43,867 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 37 transitions. Word has length 3 [2020-06-22 08:41:43,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:41:43,867 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 37 transitions. [2020-06-22 08:41:43,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:41:43,867 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. [2020-06-22 08:41:43,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 08:41:43,868 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:41:43,868 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 08:41:43,868 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 08:41:43,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:41:43,869 INFO L82 PathProgramCache]: Analyzing trace with hash 3605865, now seen corresponding path program 1 times [2020-06-22 08:41:43,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:41:43,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:41:43,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:41:43,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:41:43,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:41:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:41:43,897 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 08:41:43,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:41:43,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:41:43,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:41:43,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:41:43,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:41:43,898 INFO L87 Difference]: Start difference. First operand 22 states and 37 transitions. Second operand 3 states. [2020-06-22 08:41:43,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:41:43,954 INFO L93 Difference]: Finished difference Result 22 states and 37 transitions. [2020-06-22 08:41:43,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:41:43,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 08:41:43,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:41:43,955 INFO L225 Difference]: With dead ends: 22 [2020-06-22 08:41:43,955 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 08:41:43,956 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 08:41:43,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 08:41:43,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 08:41:43,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 08:41:43,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 29 transitions. [2020-06-22 08:41:43,959 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 29 transitions. Word has length 4 [2020-06-22 08:41:43,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:41:43,959 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 29 transitions. [2020-06-22 08:41:43,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:41:43,960 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2020-06-22 08:41:43,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 08:41:43,960 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:41:43,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 08:41:43,960 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 08:41:43,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:41:43,961 INFO L82 PathProgramCache]: Analyzing trace with hash 3605867, now seen corresponding path program 1 times [2020-06-22 08:41:43,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:41:43,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:41:43,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:41:43,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:41:43,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:41:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:41:43,983 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 08:41:43,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:41:43,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:41:43,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:41:43,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:41:43,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:41:43,984 INFO L87 Difference]: Start difference. First operand 18 states and 29 transitions. Second operand 3 states. [2020-06-22 08:41:44,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:41:44,015 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2020-06-22 08:41:44,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:41:44,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 08:41:44,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:41:44,016 INFO L225 Difference]: With dead ends: 22 [2020-06-22 08:41:44,016 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 08:41:44,017 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 08:41:44,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 08:41:44,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 08:41:44,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 08:41:44,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2020-06-22 08:41:44,020 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 4 [2020-06-22 08:41:44,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:41:44,020 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-06-22 08:41:44,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:41:44,020 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2020-06-22 08:41:44,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 08:41:44,021 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:41:44,021 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 08:41:44,021 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 08:41:44,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:41:44,021 INFO L82 PathProgramCache]: Analyzing trace with hash 3605868, now seen corresponding path program 1 times [2020-06-22 08:41:44,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:41:44,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:41:44,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:41:44,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:41:44,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:41:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:41:44,049 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 08:41:44,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:41:44,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:41:44,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:41:44,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:41:44,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:41:44,051 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 3 states. [2020-06-22 08:41:44,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:41:44,097 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-06-22 08:41:44,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:41:44,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 08:41:44,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:41:44,098 INFO L225 Difference]: With dead ends: 18 [2020-06-22 08:41:44,098 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 08:41:44,098 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 08:41:44,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 08:41:44,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 08:41:44,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 08:41:44,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 08:41:44,099 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2020-06-22 08:41:44,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:41:44,099 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:41:44,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:41:44,100 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 08:41:44,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 08:41:44,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 08:41:44,128 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 08:41:44,128 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 08:41:44,129 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 08:41:44,129 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 08:41:44,129 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2020-06-22 08:41:44,129 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 08:41:44,129 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 08:41:44,129 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-06-22 08:41:44,129 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 08:41:44,129 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2020-06-22 08:41:44,129 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-06-22 08:41:44,130 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 08:41:44,130 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 08:41:44,130 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 08:41:44,130 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 08:41:44,130 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 08:41:44,130 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 08:41:44,130 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 08:41:44,130 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 08:41:44,130 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 08:41:44,131 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 08:41:44,131 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 08:41:44,131 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 08:41:44,131 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 08:41:44,131 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2020-06-22 08:41:44,131 INFO L448 ceAbstractionStarter]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-06-22 08:41:44,131 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2020-06-22 08:41:44,131 INFO L448 ceAbstractionStarter]: For program point L12-2(line 12) no Hoare annotation was computed. [2020-06-22 08:41:44,131 INFO L448 ceAbstractionStarter]: For program point L12-3(line 12) no Hoare annotation was computed. [2020-06-22 08:41:44,132 INFO L448 ceAbstractionStarter]: For program point L12-4(line 12) no Hoare annotation was computed. [2020-06-22 08:41:44,132 INFO L448 ceAbstractionStarter]: For program point L12-6(lines 12 15) no Hoare annotation was computed. [2020-06-22 08:41:44,132 INFO L444 ceAbstractionStarter]: At program point L12-8(lines 12 15) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= 1 (select |#valid| ULTIMATE.start_test_fun_~tmp_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~tmp_ref~0.base)) (= ULTIMATE.start_test_fun_~tmp_ref~0.offset 0)) [2020-06-22 08:41:44,132 INFO L448 ceAbstractionStarter]: For program point L12-9(lines 12 15) no Hoare annotation was computed. [2020-06-22 08:41:44,133 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 08:41:44,141 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:41:44,142 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:41:44,148 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:41:44,148 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:41:44,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:41:44 BasicIcfg [2020-06-22 08:41:44,150 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 08:41:44,151 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 08:41:44,151 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 08:41:44,154 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 08:41:44,155 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:41:44,155 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 08:41:42" (1/5) ... [2020-06-22 08:41:44,156 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29186aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 08:41:44, skipping insertion in model container [2020-06-22 08:41:44,156 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:41:44,156 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:41:42" (2/5) ... [2020-06-22 08:41:44,156 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29186aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 08:41:44, skipping insertion in model container [2020-06-22 08:41:44,156 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:41:44,156 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:41:43" (3/5) ... [2020-06-22 08:41:44,157 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29186aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:41:44, skipping insertion in model container [2020-06-22 08:41:44,157 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:41:44,157 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:41:43" (4/5) ... [2020-06-22 08:41:44,157 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29186aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:41:44, skipping insertion in model container [2020-06-22 08:41:44,157 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:41:44,158 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:41:44" (5/5) ... [2020-06-22 08:41:44,159 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 08:41:44,179 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 08:41:44,179 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 08:41:44,179 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 08:41:44,180 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 08:41:44,180 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 08:41:44,180 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 08:41:44,180 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 08:41:44,180 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 08:41:44,180 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 08:41:44,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2020-06-22 08:41:44,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 08:41:44,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:41:44,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:41:44,194 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 08:41:44,194 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:41:44,194 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 08:41:44,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2020-06-22 08:41:44,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 08:41:44,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:41:44,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:41:44,197 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 08:41:44,197 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:41:44,203 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue [86] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 10#L-1true [126] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= v_ULTIMATE.start_test_fun_~tmp_1 |v_ULTIMATE.start_test_fun_#in~tmp_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~tmp_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1) |v_#valid_3|) (= |v_ULTIMATE.start_test_fun_#in~tmp_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet9_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_1, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, ULTIMATE.start_test_fun_#t~nondet7=|v_ULTIMATE.start_test_fun_#t~nondet7_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_1, ULTIMATE.start_test_fun_#in~tmp=|v_ULTIMATE.start_test_fun_#in~tmp_1|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#t~nondet2=|v_ULTIMATE.start_test_fun_#t~nondet2_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~ret11=|v_ULTIMATE.start_main_#t~ret11_1|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~tmp_ref~0.base, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_test_fun_~tmp_ref~0.offset, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, ULTIMATE.start_test_fun_#t~nondet7, #length, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~tmp, ULTIMATE.start_test_fun_#in~tmp, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#t~nondet2, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~ret11] 8#L9true [64] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_4| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|) (= 1 (select |v_#valid_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 7#L9-1true [61] L9-1-->L10: Formula: (and (= (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3 v_ULTIMATE.start_test_fun_~tmp_3)) |v_#memory_int_3|) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3) 1)) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_3, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_3, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 11#L10true [168] L10-->L12-8: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15 (store (select |v_#memory_int_16| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_11 |v_ULTIMATE.start_test_fun_#t~nondet2_5|)) |v_#memory_int_15|) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_11 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_11)) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_11, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|, ULTIMATE.start_test_fun_#t~nondet2=|v_ULTIMATE.start_test_fun_#t~nondet2_5|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_11, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_15|, #length=|v_#length_22|, ULTIMATE.start_test_fun_#t~nondet2=|v_ULTIMATE.start_test_fun_#t~nondet2_4|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~nondet2] 35#L12-8true [2020-06-22 08:41:44,204 INFO L796 eck$LassoCheckResult]: Loop: 35#L12-8true [99] L12-8-->L12-1: Formula: (and (= (select |v_#valid_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_10|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_10|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 13#L12-1true [147] L12-1-->L12-2: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short5_2|) (>= 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 12#L12-2true [73] L12-2-->L12-6: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_5|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} AuxVars[] AssignedVars[] 19#L12-6true [81] L12-6-->L13: Formula: |v_ULTIMATE.start_test_fun_#t~short5_9| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 30#L13true [92] L13-->L13-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_16|} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 29#L13-1true [171] L13-1-->L14: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) (= (store |v_#memory_int_20| v_ULTIMATE.start_test_fun_~x_ref~0.base_20 (store (select |v_#memory_int_20| v_ULTIMATE.start_test_fun_~x_ref~0.base_20) v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem6_6| (- 1)))) |v_#memory_int_19|) (= 1 (select |v_#valid_32| v_ULTIMATE.start_test_fun_~x_ref~0.base_20)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_20))) InVars {#valid=|v_#valid_32|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_25|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_20, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{#valid=|v_#valid_32|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_25|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_20, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem6] 17#L14true [174] L14-->L12-8: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12 4) (select |v_#length_28| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16)) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12) (= 1 (select |v_#valid_37| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16)) (= (store |v_#memory_int_24| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12 |v_ULTIMATE.start_test_fun_#t~nondet7_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12, ULTIMATE.start_test_fun_#t~nondet7=|v_ULTIMATE.start_test_fun_#t~nondet7_5|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_24|, #length=|v_#length_28|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12, ULTIMATE.start_test_fun_#t~nondet7=|v_ULTIMATE.start_test_fun_#t~nondet7_4|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~nondet7, #memory_int] 35#L12-8true [2020-06-22 08:41:44,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:41:44,205 INFO L82 PathProgramCache]: Analyzing trace with hash 111869186, now seen corresponding path program 1 times [2020-06-22 08:41:44,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:41:44,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:41:44,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:41:44,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:41:44,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:41:44,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:41:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:41:44,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:41:44,253 INFO L82 PathProgramCache]: Analyzing trace with hash -605196570, now seen corresponding path program 1 times [2020-06-22 08:41:44,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:41:44,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:41:44,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:41:44,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:41:44,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:41:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:41:44,264 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 08:41:44,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:41:44,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:41:44,294 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 08:41:44,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:41:44,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:41:44,296 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2020-06-22 08:41:44,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:41:44,415 INFO L93 Difference]: Finished difference Result 35 states and 60 transitions. [2020-06-22 08:41:44,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:41:44,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 60 transitions. [2020-06-22 08:41:44,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 08:41:44,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 14 states and 17 transitions. [2020-06-22 08:41:44,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-06-22 08:41:44,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-06-22 08:41:44,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2020-06-22 08:41:44,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:41:44,424 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-06-22 08:41:44,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2020-06-22 08:41:44,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-06-22 08:41:44,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 08:41:44,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2020-06-22 08:41:44,427 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-06-22 08:41:44,427 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-06-22 08:41:44,427 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 08:41:44,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2020-06-22 08:41:44,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 08:41:44,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:41:44,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:41:44,428 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 08:41:44,429 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:41:44,429 INFO L794 eck$LassoCheckResult]: Stem: 87#ULTIMATE.startENTRY [86] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 84#L-1 [126] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= v_ULTIMATE.start_test_fun_~tmp_1 |v_ULTIMATE.start_test_fun_#in~tmp_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~tmp_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1) |v_#valid_3|) (= |v_ULTIMATE.start_test_fun_#in~tmp_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet9_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_1, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, ULTIMATE.start_test_fun_#t~nondet7=|v_ULTIMATE.start_test_fun_#t~nondet7_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_1, ULTIMATE.start_test_fun_#in~tmp=|v_ULTIMATE.start_test_fun_#in~tmp_1|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#t~nondet2=|v_ULTIMATE.start_test_fun_#t~nondet2_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~ret11=|v_ULTIMATE.start_main_#t~ret11_1|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~tmp_ref~0.base, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_test_fun_~tmp_ref~0.offset, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, ULTIMATE.start_test_fun_#t~nondet7, #length, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~tmp, ULTIMATE.start_test_fun_#in~tmp, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#t~nondet2, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~ret11] 82#L9 [64] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_4| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|) (= 1 (select |v_#valid_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 79#L9-1 [61] L9-1-->L10: Formula: (and (= (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3 v_ULTIMATE.start_test_fun_~tmp_3)) |v_#memory_int_3|) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3) 1)) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_3, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_3, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 80#L10 [168] L10-->L12-8: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15 (store (select |v_#memory_int_16| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_11 |v_ULTIMATE.start_test_fun_#t~nondet2_5|)) |v_#memory_int_15|) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_11 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_11)) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_11, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|, ULTIMATE.start_test_fun_#t~nondet2=|v_ULTIMATE.start_test_fun_#t~nondet2_5|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_11, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_15|, #length=|v_#length_22|, ULTIMATE.start_test_fun_#t~nondet2=|v_ULTIMATE.start_test_fun_#t~nondet2_4|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~nondet2] 85#L12-8 [2020-06-22 08:41:44,430 INFO L796 eck$LassoCheckResult]: Loop: 85#L12-8 [99] L12-8-->L12-1: Formula: (and (= (select |v_#valid_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_10|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_10|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 88#L12-1 [148] L12-1-->L12-2: Formula: (and (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short5_2|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 86#L12-2 [72] L12-2-->L12-3: Formula: |v_ULTIMATE.start_test_fun_#t~short5_3| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} AuxVars[] AssignedVars[] 83#L12-3 [83] L12-3-->L12-4: Formula: (and (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7) (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7))) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 81#L12-4 [153] L12-4-->L12-6: Formula: (and |v_ULTIMATE.start_test_fun_#t~short5_4| (= v_ULTIMATE.start_test_fun_~x_4 (* 2 |v_ULTIMATE.start_test_fun_#t~mem4_3|))) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_4} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_4} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 77#L12-6 [81] L12-6-->L13: Formula: |v_ULTIMATE.start_test_fun_#t~short5_9| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 78#L13 [92] L13-->L13-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_16|} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 89#L13-1 [171] L13-1-->L14: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) (= (store |v_#memory_int_20| v_ULTIMATE.start_test_fun_~x_ref~0.base_20 (store (select |v_#memory_int_20| v_ULTIMATE.start_test_fun_~x_ref~0.base_20) v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem6_6| (- 1)))) |v_#memory_int_19|) (= 1 (select |v_#valid_32| v_ULTIMATE.start_test_fun_~x_ref~0.base_20)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_20))) InVars {#valid=|v_#valid_32|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_25|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_20, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{#valid=|v_#valid_32|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_25|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_20, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem6] 90#L14 [174] L14-->L12-8: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12 4) (select |v_#length_28| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16)) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12) (= 1 (select |v_#valid_37| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16)) (= (store |v_#memory_int_24| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12 |v_ULTIMATE.start_test_fun_#t~nondet7_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12, ULTIMATE.start_test_fun_#t~nondet7=|v_ULTIMATE.start_test_fun_#t~nondet7_5|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_24|, #length=|v_#length_28|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12, ULTIMATE.start_test_fun_#t~nondet7=|v_ULTIMATE.start_test_fun_#t~nondet7_4|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~nondet7, #memory_int] 85#L12-8 [2020-06-22 08:41:44,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:41:44,431 INFO L82 PathProgramCache]: Analyzing trace with hash 111869186, now seen corresponding path program 2 times [2020-06-22 08:41:44,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:41:44,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:41:44,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:41:44,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:41:44,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:41:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:41:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:41:44,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:41:44,456 INFO L82 PathProgramCache]: Analyzing trace with hash -807173590, now seen corresponding path program 1 times [2020-06-22 08:41:44,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:41:44,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:41:44,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:41:44,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:41:44,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:41:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:41:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:41:44,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:41:44,476 INFO L82 PathProgramCache]: Analyzing trace with hash 831428169, now seen corresponding path program 1 times [2020-06-22 08:41:44,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:41:44,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:41:44,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:41:44,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:41:44,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:41:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:41:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:41:44,855 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2020-06-22 08:41:44,961 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:41:44,962 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:41:44,962 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:41:44,962 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:41:44,962 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:41:44,962 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:41:44,963 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:41:44,963 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:41:44,963 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 08:41:44,963 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:41:44,964 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:41:44,981 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 08:41:44,986 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 08:41:44,989 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 08:41:44,993 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 08:41:44,995 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 08:41:44,997 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 08:41:45,186 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2020-06-22 08:41:45,257 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 08:41:45,259 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 08:41:45,261 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 08:41:45,263 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 08:41:45,264 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 08:41:45,269 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 08:41:45,271 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 08:41:45,273 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 08:41:45,605 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:41:45,611 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:41:45,613 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 08:41:45,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:41:45,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:41:45,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:41:45,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:41:45,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:41:45,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:41:45,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:41:45,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:41:45,619 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 08:41:45,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:41:45,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:41:45,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:41:45,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:41:45,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:41:45,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:41:45,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:41:45,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:41:45,623 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 08:41:45,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:41:45,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:41:45,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:41:45,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:41:45,626 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:41:45,626 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:41:45,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:41:45,630 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 08:41:45,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:41:45,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:41:45,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:41:45,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:41:45,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:41:45,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:41:45,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:41:45,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:41:45,633 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 08:41:45,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:41:45,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:41:45,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:41:45,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:41:45,635 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:41:45,635 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:41:45,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:41:45,639 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 08:41:45,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:41:45,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:41:45,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:41:45,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:41:45,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:41:45,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:41:45,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:41:45,661 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 08:41:45,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:41:45,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:41:45,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:41:45,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:41:45,664 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:41:45,665 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:41:45,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:41:45,675 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 08:41:45,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:41:45,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:41:45,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:41:45,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:41:45,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:41:45,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:41:45,704 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:41:45,715 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 08:41:45,715 INFO L444 ModelExtractionUtils]: 19 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 08:41:45,717 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:41:45,719 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 08:41:45,719 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:41:45,719 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2020-06-22 08:41:45,750 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2020-06-22 08:41:45,753 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:41:45,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:41:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:41:45,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:41:45,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:41:45,837 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 08:41:45,837 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:41:45,841 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:41:45,842 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:41:45,842 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2020-06-22 08:41:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:41:45,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:41:45,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:41:45,924 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 35 treesize of output 19 [2020-06-22 08:41:45,925 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:41:45,934 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:41:45,935 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:41:45,935 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2020-06-22 08:41:45,952 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 08:41:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:41:46,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:41:46,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:41:46,075 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 28 treesize of output 16 [2020-06-22 08:41:46,075 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:41:46,083 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:41:46,083 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:41:46,083 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2020-06-22 08:41:46,115 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 21 treesize of output 20 [2020-06-22 08:41:46,115 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:41:46,121 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:41:46,122 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:41:46,122 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-06-22 08:41:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:41:46,173 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:41:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:41:46,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:41:46,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:41:46,190 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 19 treesize of output 18 [2020-06-22 08:41:46,191 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:41:46,198 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:41:46,199 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:41:46,199 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 [2020-06-22 08:41:46,208 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-06-22 08:41:46,212 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 7 loop predicates [2020-06-22 08:41:46,213 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 17 transitions. cyclomatic complexity: 4 Second operand 7 states. [2020-06-22 08:41:46,364 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 17 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 24 states and 28 transitions. Complement of second has 13 states. [2020-06-22 08:41:46,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2020-06-22 08:41:46,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 08:41:46,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2020-06-22 08:41:46,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 5 letters. Loop has 9 letters. [2020-06-22 08:41:46,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:41:46,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 14 letters. Loop has 9 letters. [2020-06-22 08:41:46,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:41:46,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 5 letters. Loop has 18 letters. [2020-06-22 08:41:46,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:41:46,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2020-06-22 08:41:46,377 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 08:41:46,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2020-06-22 08:41:46,377 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 08:41:46,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 08:41:46,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 08:41:46,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:41:46,377 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:41:46,378 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:41:46,378 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:41:46,378 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 08:41:46,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 08:41:46,378 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 08:41:46,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 08:41:46,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:41:46 BasicIcfg [2020-06-22 08:41:46,384 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 08:41:46,384 INFO L168 Benchmark]: Toolchain (without parser) took 4099.24 ms. Allocated memory was 649.6 MB in the beginning and 747.6 MB in the end (delta: 98.0 MB). Free memory was 564.3 MB in the beginning and 465.9 MB in the end (delta: 98.4 MB). Peak memory consumption was 196.4 MB. Max. memory is 50.3 GB. [2020-06-22 08:41:46,385 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 08:41:46,385 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.81 ms. Allocated memory was 649.6 MB in the beginning and 685.2 MB in the end (delta: 35.7 MB). Free memory was 564.3 MB in the beginning and 648.7 MB in the end (delta: -84.4 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. [2020-06-22 08:41:46,386 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.40 ms. Allocated memory is still 685.2 MB. Free memory was 648.7 MB in the beginning and 647.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 08:41:46,387 INFO L168 Benchmark]: Boogie Preprocessor took 23.70 ms. Allocated memory is still 685.2 MB. Free memory was 647.3 MB in the beginning and 644.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-06-22 08:41:46,387 INFO L168 Benchmark]: RCFGBuilder took 352.00 ms. Allocated memory is still 685.2 MB. Free memory was 644.6 MB in the beginning and 622.3 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 50.3 GB. [2020-06-22 08:41:46,388 INFO L168 Benchmark]: BlockEncodingV2 took 128.48 ms. Allocated memory is still 685.2 MB. Free memory was 622.3 MB in the beginning and 611.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-06-22 08:41:46,388 INFO L168 Benchmark]: TraceAbstraction took 1006.05 ms. Allocated memory is still 685.2 MB. Free memory was 611.5 MB in the beginning and 513.4 MB in the end (delta: 98.2 MB). Peak memory consumption was 98.2 MB. Max. memory is 50.3 GB. [2020-06-22 08:41:46,389 INFO L168 Benchmark]: BuchiAutomizer took 2232.72 ms. Allocated memory was 685.2 MB in the beginning and 747.6 MB in the end (delta: 62.4 MB). Free memory was 513.4 MB in the beginning and 465.9 MB in the end (delta: 47.5 MB). Peak memory consumption was 109.9 MB. Max. memory is 50.3 GB. [2020-06-22 08:41:46,393 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 41 locations, 43 edges - StatisticsResult: Encoded RCFG 33 locations, 58 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 308.81 ms. Allocated memory was 649.6 MB in the beginning and 685.2 MB in the end (delta: 35.7 MB). Free memory was 564.3 MB in the beginning and 648.7 MB in the end (delta: -84.4 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 42.40 ms. Allocated memory is still 685.2 MB. Free memory was 648.7 MB in the beginning and 647.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 23.70 ms. Allocated memory is still 685.2 MB. Free memory was 647.3 MB in the beginning and 644.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * RCFGBuilder took 352.00 ms. Allocated memory is still 685.2 MB. Free memory was 644.6 MB in the beginning and 622.3 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 128.48 ms. Allocated memory is still 685.2 MB. Free memory was 622.3 MB in the beginning and 611.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1006.05 ms. Allocated memory is still 685.2 MB. Free memory was 611.5 MB in the beginning and 513.4 MB in the end (delta: 98.2 MB). Peak memory consumption was 98.2 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 2232.72 ms. Allocated memory was 685.2 MB in the beginning and 747.6 MB in the end (delta: 62.4 MB). Free memory was 513.4 MB in the beginning and 465.9 MB in the end (delta: 47.5 MB). Peak memory consumption was 109.9 MB. Max. memory is 50.3 GB. * 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: 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: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant [2020-06-22 08:41:46,402 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:41:46,402 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:41:46,402 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:41:46,403 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((4 == unknown-#length-unknown[x_ref] && x_ref == 0) && 1 == \valid[tmp_ref]) && 1 == \valid[x_ref]) && 4 == unknown-#length-unknown[tmp_ref]) && tmp_ref == 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 18 error locations. SAFE Result, 0.9s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 35 SDtfs, 171 SDslu, 4 SDs, 0 SdLazy, 171 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 27 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 151 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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-#memory_int-unknown[x_ref][x_ref] and consists of 8 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. 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 14 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 16 SDtfs, 57 SDslu, 55 SDs, 0 SdLazy, 143 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital216 mio100 ax100 hnf100 lsp93 ukn64 mio100 lsp38 div100 bol100 ite100 ukn100 eq172 hnf89 smp96 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms 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 08:41:39.106 ----------------------------------------------- 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 08:41:46.629 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check