YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 11:16:10,642 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 11:16:10,644 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 11:16:10,655 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 11:16:10,656 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 11:16:10,657 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 11:16:10,658 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 11:16:10,660 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 11:16:10,661 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 11:16:10,662 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 11:16:10,663 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 11:16:10,663 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 11:16:10,664 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 11:16:10,665 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 11:16:10,666 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 11:16:10,666 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 11:16:10,667 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 11:16:10,669 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 11:16:10,671 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 11:16:10,672 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 11:16:10,673 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 11:16:10,674 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 11:16:10,676 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 11:16:10,677 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 11:16:10,677 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 11:16:10,677 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 11:16:10,678 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 11:16:10,679 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 11:16:10,679 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 11:16:10,680 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 11:16:10,680 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 11:16:10,681 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 11:16:10,682 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 11:16:10,682 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 11:16:10,682 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 11:16:10,683 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 11:16:10,683 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 11:16:10,684 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 11:16:10,684 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 11:16:10,685 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 11:16:10,698 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 11:16:10,699 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 11:16:10,700 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 11:16:10,700 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 11:16:10,700 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 11:16:10,700 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 11:16:10,700 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 11:16:10,701 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 11:16:10,701 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 11:16:10,701 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 11:16:10,701 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 11:16:10,701 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 11:16:10,701 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 11:16:10,701 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 11:16:10,702 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 11:16:10,702 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 11:16:10,702 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 11:16:10,702 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 11:16:10,702 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 11:16:10,702 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 11:16:10,703 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 11:16:10,703 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 11:16:10,703 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 11:16:10,703 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 11:16:10,703 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 11:16:10,703 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 11:16:10,704 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 11:16:10,704 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 11:16:10,704 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 11:16:10,730 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 11:16:10,744 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 11:16:10,747 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 11:16:10,749 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 11:16:10,749 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 11:16:10,750 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 11:16:10,855 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/d91e1582f22d4774b50766bd82e56e2a/FLAGca7284818 !SESSION 2020-06-22 11:16:08.320 ----------------------------------------------- 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/sandbox2/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/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.cdt.core 1 0 2020-06-22 11:16:11.126 !MESSAGE Indexed 'FLAGca7284818' (0 sources, 0 headers) in 0.011 sec: 0 declarations; 0 references; 0 unresolved inclusions; 0 syntax errors; 0 unresolved names (0%) [2020-06-22 11:16:11,209 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 11:16:11,210 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 11:16:11,210 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 11:16:11,216 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/d91e1582f22d4774b50766bd82e56e2a/FLAGca7284818 [2020-06-22 11:16:11,649 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/d91e1582f22d4774b50766bd82e56e2a [2020-06-22 11:16:11,660 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 11:16:11,663 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 11:16:11,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 11:16:11,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 11:16:11,667 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 11:16:11,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 11:16:11" (1/1) ... [2020-06-22 11:16:11,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@443f990d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:16:11, skipping insertion in model container [2020-06-22 11:16:11,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 11:16:11" (1/1) ... [2020-06-22 11:16:11,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 11:16:11,696 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 11:16:11,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 11:16:11,920 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 11:16:11,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 11:16:11,952 INFO L195 MainTranslator]: Completed translation [2020-06-22 11:16:11,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:16:11 WrapperNode [2020-06-22 11:16:11,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 11:16:11,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 11:16:11,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 11:16:11,953 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 11:16:11,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:16:11" (1/1) ... [2020-06-22 11:16:11,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:16:11" (1/1) ... [2020-06-22 11:16:11,992 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 11:16:11,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 11:16:11,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 11:16:11,993 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 11:16:12,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:16:11" (1/1) ... [2020-06-22 11:16:12,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:16:11" (1/1) ... [2020-06-22 11:16:12,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:16:11" (1/1) ... [2020-06-22 11:16:12,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:16:11" (1/1) ... [2020-06-22 11:16:12,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:16:11" (1/1) ... [2020-06-22 11:16:12,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:16:11" (1/1) ... [2020-06-22 11:16:12,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:16:11" (1/1) ... [2020-06-22 11:16:12,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 11:16:12,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 11:16:12,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 11:16:12,016 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 11:16:12,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:16:11" (1/1) ... No working directory specified, using /export/starexec/sandbox2/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 11:16:12,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 11:16:12,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 11:16:12,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 11:16:12,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 11:16:12,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 11:16:12,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 11:16:12,326 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 11:16:12,326 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 11:16:12,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:16:12 BoogieIcfgContainer [2020-06-22 11:16:12,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 11:16:12,328 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 11:16:12,328 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 11:16:12,330 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 11:16:12,331 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:16:12" (1/1) ... [2020-06-22 11:16:12,347 INFO L313 BlockEncoder]: Initial Icfg 44 locations, 45 edges [2020-06-22 11:16:12,349 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 11:16:12,350 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 11:16:12,350 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 11:16:12,351 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 11:16:12,352 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 11:16:12,353 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 11:16:12,353 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 11:16:12,376 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 11:16:12,414 INFO L200 BlockEncoder]: SBE split 23 edges [2020-06-22 11:16:12,421 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 11:16:12,423 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 11:16:12,458 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-06-22 11:16:12,461 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 11:16:12,462 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 11:16:12,463 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 11:16:12,463 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 11:16:12,464 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 11:16:12,464 INFO L313 BlockEncoder]: Encoded RCFG 36 locations, 65 edges [2020-06-22 11:16:12,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 11:16:12 BasicIcfg [2020-06-22 11:16:12,465 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 11:16:12,466 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 11:16:12,466 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 11:16:12,469 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 11:16:12,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 11:16:11" (1/4) ... [2020-06-22 11:16:12,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@787fa26e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:16:12, skipping insertion in model container [2020-06-22 11:16:12,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:16:11" (2/4) ... [2020-06-22 11:16:12,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@787fa26e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:16:12, skipping insertion in model container [2020-06-22 11:16:12,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:16:12" (3/4) ... [2020-06-22 11:16:12,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@787fa26e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:16:12, skipping insertion in model container [2020-06-22 11:16:12,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 11:16:12" (4/4) ... [2020-06-22 11:16:12,473 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 11:16:12,483 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 11:16:12,491 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. [2020-06-22 11:16:12,508 INFO L257 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2020-06-22 11:16:12,536 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 11:16:12,537 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 11:16:12,537 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 11:16:12,537 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 11:16:12,538 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 11:16:12,538 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 11:16:12,538 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 11:16:12,538 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 11:16:12,538 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 11:16:12,553 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2020-06-22 11:16:12,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 11:16:12,559 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:16:12,560 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 11:16:12,561 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 11:16:12,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:16:12,566 INFO L82 PathProgramCache]: Analyzing trace with hash 111734, now seen corresponding path program 1 times [2020-06-22 11:16:12,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:16:12,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:16:12,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:12,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:16:12,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:16:12,748 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 11:16:12,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:16:12,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 11:16:12,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 11:16:12,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:16:12,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:16:12,771 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2020-06-22 11:16:12,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:16:12,934 INFO L93 Difference]: Finished difference Result 36 states and 65 transitions. [2020-06-22 11:16:12,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:16:12,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 11:16:12,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:16:12,950 INFO L225 Difference]: With dead ends: 36 [2020-06-22 11:16:12,950 INFO L226 Difference]: Without dead ends: 34 [2020-06-22 11:16:12,953 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 11:16:12,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-06-22 11:16:12,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-06-22 11:16:12,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-06-22 11:16:12,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 61 transitions. [2020-06-22 11:16:12,993 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 61 transitions. Word has length 3 [2020-06-22 11:16:12,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:16:12,994 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 61 transitions. [2020-06-22 11:16:12,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 11:16:12,994 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 61 transitions. [2020-06-22 11:16:12,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 11:16:12,995 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:16:12,995 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 11:16:12,995 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 11:16:12,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:16:12,996 INFO L82 PathProgramCache]: Analyzing trace with hash 111736, now seen corresponding path program 1 times [2020-06-22 11:16:12,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:16:12,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:16:12,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:12,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:16:12,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:16:13,023 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 11:16:13,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:16:13,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 11:16:13,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 11:16:13,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:16:13,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:16:13,026 INFO L87 Difference]: Start difference. First operand 34 states and 61 transitions. Second operand 3 states. [2020-06-22 11:16:13,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:16:13,112 INFO L93 Difference]: Finished difference Result 36 states and 61 transitions. [2020-06-22 11:16:13,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:16:13,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 11:16:13,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:16:13,137 INFO L225 Difference]: With dead ends: 36 [2020-06-22 11:16:13,137 INFO L226 Difference]: Without dead ends: 34 [2020-06-22 11:16:13,138 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 11:16:13,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-06-22 11:16:13,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-06-22 11:16:13,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-06-22 11:16:13,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 59 transitions. [2020-06-22 11:16:13,144 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 59 transitions. Word has length 3 [2020-06-22 11:16:13,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:16:13,145 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 59 transitions. [2020-06-22 11:16:13,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 11:16:13,145 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 59 transitions. [2020-06-22 11:16:13,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 11:16:13,145 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:16:13,146 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 11:16:13,146 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 11:16:13,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:16:13,146 INFO L82 PathProgramCache]: Analyzing trace with hash 111737, now seen corresponding path program 1 times [2020-06-22 11:16:13,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:16:13,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:16:13,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:13,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:16:13,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:16:13,201 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 11:16:13,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:16:13,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 11:16:13,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 11:16:13,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:16:13,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:16:13,203 INFO L87 Difference]: Start difference. First operand 34 states and 59 transitions. Second operand 3 states. [2020-06-22 11:16:13,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:16:13,304 INFO L93 Difference]: Finished difference Result 34 states and 59 transitions. [2020-06-22 11:16:13,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:16:13,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 11:16:13,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:16:13,306 INFO L225 Difference]: With dead ends: 34 [2020-06-22 11:16:13,306 INFO L226 Difference]: Without dead ends: 32 [2020-06-22 11:16:13,306 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 11:16:13,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-06-22 11:16:13,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-06-22 11:16:13,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 11:16:13,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 57 transitions. [2020-06-22 11:16:13,311 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 57 transitions. Word has length 3 [2020-06-22 11:16:13,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:16:13,311 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 57 transitions. [2020-06-22 11:16:13,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 11:16:13,311 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 57 transitions. [2020-06-22 11:16:13,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 11:16:13,312 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:16:13,312 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 11:16:13,312 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 11:16:13,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:16:13,312 INFO L82 PathProgramCache]: Analyzing trace with hash 3461536, now seen corresponding path program 1 times [2020-06-22 11:16:13,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:16:13,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:16:13,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:13,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:16:13,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:16:13,343 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 11:16:13,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:16:13,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 11:16:13,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 11:16:13,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:16:13,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:16:13,345 INFO L87 Difference]: Start difference. First operand 32 states and 57 transitions. Second operand 3 states. [2020-06-22 11:16:13,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:16:13,442 INFO L93 Difference]: Finished difference Result 32 states and 57 transitions. [2020-06-22 11:16:13,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:16:13,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 11:16:13,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:16:13,443 INFO L225 Difference]: With dead ends: 32 [2020-06-22 11:16:13,444 INFO L226 Difference]: Without dead ends: 28 [2020-06-22 11:16:13,444 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 11:16:13,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-06-22 11:16:13,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-06-22 11:16:13,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 11:16:13,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 49 transitions. [2020-06-22 11:16:13,448 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 49 transitions. Word has length 4 [2020-06-22 11:16:13,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:16:13,449 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 49 transitions. [2020-06-22 11:16:13,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 11:16:13,449 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 49 transitions. [2020-06-22 11:16:13,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 11:16:13,449 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:16:13,449 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 11:16:13,450 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 11:16:13,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:16:13,450 INFO L82 PathProgramCache]: Analyzing trace with hash 3461538, now seen corresponding path program 1 times [2020-06-22 11:16:13,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:16:13,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:16:13,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:13,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:16:13,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:16:13,479 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 11:16:13,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:16:13,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 11:16:13,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 11:16:13,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:16:13,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:16:13,481 INFO L87 Difference]: Start difference. First operand 28 states and 49 transitions. Second operand 3 states. [2020-06-22 11:16:13,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:16:13,578 INFO L93 Difference]: Finished difference Result 32 states and 49 transitions. [2020-06-22 11:16:13,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:16:13,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 11:16:13,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:16:13,580 INFO L225 Difference]: With dead ends: 32 [2020-06-22 11:16:13,580 INFO L226 Difference]: Without dead ends: 28 [2020-06-22 11:16:13,580 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 11:16:13,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-06-22 11:16:13,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-06-22 11:16:13,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 11:16:13,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 45 transitions. [2020-06-22 11:16:13,585 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 45 transitions. Word has length 4 [2020-06-22 11:16:13,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:16:13,585 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 45 transitions. [2020-06-22 11:16:13,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 11:16:13,585 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. [2020-06-22 11:16:13,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 11:16:13,586 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:16:13,586 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 11:16:13,586 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 11:16:13,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:16:13,586 INFO L82 PathProgramCache]: Analyzing trace with hash 3461539, now seen corresponding path program 1 times [2020-06-22 11:16:13,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:16:13,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:16:13,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:13,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:16:13,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:16:13,622 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 11:16:13,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:16:13,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 11:16:13,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 11:16:13,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:16:13,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:16:13,624 INFO L87 Difference]: Start difference. First operand 28 states and 45 transitions. Second operand 3 states. [2020-06-22 11:16:13,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:16:13,695 INFO L93 Difference]: Finished difference Result 28 states and 45 transitions. [2020-06-22 11:16:13,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:16:13,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 11:16:13,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:16:13,697 INFO L225 Difference]: With dead ends: 28 [2020-06-22 11:16:13,697 INFO L226 Difference]: Without dead ends: 23 [2020-06-22 11:16:13,697 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 11:16:13,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-06-22 11:16:13,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-06-22 11:16:13,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 11:16:13,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 40 transitions. [2020-06-22 11:16:13,701 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 40 transitions. Word has length 4 [2020-06-22 11:16:13,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:16:13,702 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 40 transitions. [2020-06-22 11:16:13,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 11:16:13,702 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 40 transitions. [2020-06-22 11:16:13,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 11:16:13,702 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:16:13,702 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 11:16:13,702 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 11:16:13,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:16:13,703 INFO L82 PathProgramCache]: Analyzing trace with hash 107305869, now seen corresponding path program 1 times [2020-06-22 11:16:13,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:16:13,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:16:13,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:13,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:16:13,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:16:13,737 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 11:16:13,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:16:13,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 11:16:13,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 11:16:13,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:16:13,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:16:13,738 INFO L87 Difference]: Start difference. First operand 23 states and 40 transitions. Second operand 3 states. [2020-06-22 11:16:13,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:16:13,798 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2020-06-22 11:16:13,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:16:13,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 11:16:13,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:16:13,799 INFO L225 Difference]: With dead ends: 28 [2020-06-22 11:16:13,800 INFO L226 Difference]: Without dead ends: 23 [2020-06-22 11:16:13,800 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 11:16:13,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-06-22 11:16:13,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-06-22 11:16:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 11:16:13,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2020-06-22 11:16:13,803 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 35 transitions. Word has length 5 [2020-06-22 11:16:13,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:16:13,803 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 35 transitions. [2020-06-22 11:16:13,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 11:16:13,803 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 35 transitions. [2020-06-22 11:16:13,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 11:16:13,804 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:16:13,804 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 11:16:13,804 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 11:16:13,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:16:13,805 INFO L82 PathProgramCache]: Analyzing trace with hash 107305870, now seen corresponding path program 1 times [2020-06-22 11:16:13,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:16:13,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:16:13,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:13,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:16:13,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:16:13,845 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 11:16:13,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:16:13,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 11:16:13,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 11:16:13,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:16:13,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:16:13,846 INFO L87 Difference]: Start difference. First operand 23 states and 35 transitions. Second operand 3 states. [2020-06-22 11:16:13,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:16:13,905 INFO L93 Difference]: Finished difference Result 23 states and 35 transitions. [2020-06-22 11:16:13,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:16:13,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 11:16:13,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:16:13,906 INFO L225 Difference]: With dead ends: 23 [2020-06-22 11:16:13,906 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 11:16:13,906 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 11:16:13,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 11:16:13,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 11:16:13,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 11:16:13,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2020-06-22 11:16:13,909 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 30 transitions. Word has length 5 [2020-06-22 11:16:13,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:16:13,910 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 30 transitions. [2020-06-22 11:16:13,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 11:16:13,910 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 30 transitions. [2020-06-22 11:16:13,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 11:16:13,910 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:16:13,910 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 11:16:13,911 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 11:16:13,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:16:13,911 INFO L82 PathProgramCache]: Analyzing trace with hash 107305867, now seen corresponding path program 1 times [2020-06-22 11:16:13,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:16:13,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:16:13,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:13,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:16:13,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:16:13,937 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 11:16:13,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:16:13,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 11:16:13,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 11:16:13,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:16:13,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:16:13,938 INFO L87 Difference]: Start difference. First operand 18 states and 30 transitions. Second operand 3 states. [2020-06-22 11:16:13,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:16:13,987 INFO L93 Difference]: Finished difference Result 18 states and 30 transitions. [2020-06-22 11:16:13,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:16:13,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 11:16:13,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:16:13,988 INFO L225 Difference]: With dead ends: 18 [2020-06-22 11:16:13,988 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 11:16:13,989 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 11:16:13,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 11:16:13,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 11:16:13,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 11:16:13,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 11:16:13,990 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-06-22 11:16:13,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:16:13,990 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 11:16:13,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 11:16:13,990 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 11:16:13,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 11:16:13,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 11:16:14,024 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 11:16:14,025 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 11:16:14,025 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 11:16:14,025 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 11:16:14,025 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2020-06-22 11:16:14,025 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 11:16:14,026 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-06-22 11:16:14,026 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 11:16:14,026 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2020-06-22 11:16:14,026 INFO L448 ceAbstractionStarter]: For program point L13-2(line 13) no Hoare annotation was computed. [2020-06-22 11:16:14,026 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 11:16:14,026 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 11:16:14,026 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 11:16:14,026 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 11:16:14,027 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 11:16:14,027 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 11:16:14,027 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 11:16:14,027 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 11:16:14,027 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 11:16:14,027 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 11:16:14,027 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 11:16:14,027 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 11:16:14,027 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 11:16:14,028 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 11:16:14,028 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 11:16:14,028 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 11:16:14,028 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 11:16:14,028 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 11:16:14,028 INFO L448 ceAbstractionStarter]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-06-22 11:16:14,028 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2020-06-22 11:16:14,028 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 12 14) no Hoare annotation was computed. [2020-06-22 11:16:14,028 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-06-22 11:16:14,028 INFO L448 ceAbstractionStarter]: For program point L12-4(lines 12 14) no Hoare annotation was computed. [2020-06-22 11:16:14,029 INFO L448 ceAbstractionStarter]: For program point L12-6(line 12) no Hoare annotation was computed. [2020-06-22 11:16:14,029 INFO L444 ceAbstractionStarter]: At program point L12-8(lines 12 14) the Hoare annotation is: (and (= 0 ULTIMATE.start_iterate_~i~0.offset) (= (select |#valid| ULTIMATE.start_iterate_~i~0.base) 1) (= ULTIMATE.start_iterate_~bound_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_iterate_~bound_ref~0.base)) (= ULTIMATE.start_iterate_~sum~0.offset 0) (= (select |#length| ULTIMATE.start_iterate_~i~0.base) 4) (= 4 (select |#length| ULTIMATE.start_iterate_~sum~0.base)) (= (select |#valid| ULTIMATE.start_iterate_~sum~0.base) 1) (= (select |#valid| ULTIMATE.start_iterate_~bound_ref~0.base) 1)) [2020-06-22 11:16:14,029 INFO L448 ceAbstractionStarter]: For program point L12-9(lines 12 14) no Hoare annotation was computed. [2020-06-22 11:16:14,030 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 11:16:14,039 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:16:14,040 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:16:14,040 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:16:14,046 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:16:14,046 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:16:14,046 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:16:14,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:16:14 BasicIcfg [2020-06-22 11:16:14,049 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 11:16:14,049 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 11:16:14,049 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 11:16:14,052 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 11:16:14,053 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 11:16:14,053 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 11:16:11" (1/5) ... [2020-06-22 11:16:14,054 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5039d128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 11:16:14, skipping insertion in model container [2020-06-22 11:16:14,054 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 11:16:14,054 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:16:11" (2/5) ... [2020-06-22 11:16:14,054 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5039d128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 11:16:14, skipping insertion in model container [2020-06-22 11:16:14,055 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 11:16:14,055 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:16:12" (3/5) ... [2020-06-22 11:16:14,055 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5039d128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 11:16:14, skipping insertion in model container [2020-06-22 11:16:14,055 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 11:16:14,056 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 11:16:12" (4/5) ... [2020-06-22 11:16:14,056 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5039d128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 11:16:14, skipping insertion in model container [2020-06-22 11:16:14,056 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 11:16:14,056 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:16:14" (5/5) ... [2020-06-22 11:16:14,058 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 11:16:14,077 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 11:16:14,078 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 11:16:14,078 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 11:16:14,078 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 11:16:14,078 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 11:16:14,078 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 11:16:14,079 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 11:16:14,079 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 11:16:14,079 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 11:16:14,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states. [2020-06-22 11:16:14,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 11:16:14,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:16:14,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:16:14,092 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 11:16:14,092 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:16:14,092 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 11:16:14,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states. [2020-06-22 11:16:14,094 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 11:16:14,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:16:14,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:16:14,095 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 11:16:14,095 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:16:14,102 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue [81] 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] 8#L-1true [127] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_iterate_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_iterate_#t~malloc1.base_1| 1))) (and (= v_ULTIMATE.start_iterate_~bound_1 |v_ULTIMATE.start_iterate_#in~bound_1|) (= v_ULTIMATE.start_iterate_~bound_ref~0.base_1 |v_ULTIMATE.start_iterate_#t~malloc0.base_1|) (< |v_ULTIMATE.start_iterate_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_iterate_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_iterate_~sum~0.base_1 |v_ULTIMATE.start_iterate_#t~malloc2.base_1|) (= |v_ULTIMATE.start_iterate_#in~bound_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (< |v_ULTIMATE.start_iterate_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_iterate_~i~0.base_1 |v_ULTIMATE.start_iterate_#t~malloc1.base_1|) (= v_ULTIMATE.start_iterate_~bound_ref~0.offset_1 |v_ULTIMATE.start_iterate_#t~malloc0.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_iterate_#t~malloc0.base_1|) 0) (< |v_ULTIMATE.start_iterate_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= (select .cse0 |v_ULTIMATE.start_iterate_#t~malloc2.base_1|) 0) (= 0 |v_ULTIMATE.start_iterate_#t~malloc1.offset_1|) (= (store (store (store |v_#length_4| |v_ULTIMATE.start_iterate_#t~malloc0.base_1| 4) |v_ULTIMATE.start_iterate_#t~malloc1.base_1| 4) |v_ULTIMATE.start_iterate_#t~malloc2.base_1| 4) |v_#length_1|) (> |v_ULTIMATE.start_iterate_#t~malloc2.base_1| 0) (= v_ULTIMATE.start_iterate_~sum~0.offset_1 |v_ULTIMATE.start_iterate_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_iterate_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_iterate_#t~malloc0.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_iterate_#t~malloc1.base_1|)) (= 0 |v_ULTIMATE.start_iterate_#t~malloc2.offset_1|) (= v_ULTIMATE.start_iterate_~i~0.offset_1 |v_ULTIMATE.start_iterate_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_iterate_#t~malloc1.base_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_iterate_#t~malloc0.offset=|v_ULTIMATE.start_iterate_#t~malloc0.offset_1|, ULTIMATE.start_iterate_~bound_ref~0.offset=v_ULTIMATE.start_iterate_~bound_ref~0.offset_1, ULTIMATE.start_iterate_#t~malloc0.base=|v_ULTIMATE.start_iterate_#t~malloc0.base_1|, ULTIMATE.start_iterate_#t~malloc1.base=|v_ULTIMATE.start_iterate_#t~malloc1.base_1|, ULTIMATE.start_iterate_#t~malloc2.base=|v_ULTIMATE.start_iterate_#t~malloc2.base_1|, ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_1, ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_1, ULTIMATE.start_iterate_~bound_ref~0.base=v_ULTIMATE.start_iterate_~bound_ref~0.base_1, #length=|v_#length_1|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_1, ULTIMATE.start_iterate_#t~post4=|v_ULTIMATE.start_iterate_#t~post4_1|, ULTIMATE.start_iterate_#t~malloc2.offset=|v_ULTIMATE.start_iterate_#t~malloc2.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_iterate_#t~malloc1.offset=|v_ULTIMATE.start_iterate_#t~malloc1.offset_1|, ULTIMATE.start_iterate_#t~mem7=|v_ULTIMATE.start_iterate_#t~mem7_1|, ULTIMATE.start_iterate_#t~mem6=|v_ULTIMATE.start_iterate_#t~mem6_1|, ULTIMATE.start_iterate_#in~bound=|v_ULTIMATE.start_iterate_#in~bound_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_iterate_#t~mem9=|v_ULTIMATE.start_iterate_#t~mem9_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~ret11=|v_ULTIMATE.start_main_#t~ret11_1|, ULTIMATE.start_iterate_#t~mem8=|v_ULTIMATE.start_iterate_#t~mem8_1|, ULTIMATE.start_iterate_#t~mem3=|v_ULTIMATE.start_iterate_#t~mem3_1|, ULTIMATE.start_iterate_#t~mem5=|v_ULTIMATE.start_iterate_#t~mem5_1|, ULTIMATE.start_iterate_~bound=v_ULTIMATE.start_iterate_~bound_1, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_1, ULTIMATE.start_iterate_#res=|v_ULTIMATE.start_iterate_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_iterate_#t~malloc0.offset, ULTIMATE.start_iterate_~bound_ref~0.offset, ULTIMATE.start_iterate_#t~malloc0.base, ULTIMATE.start_iterate_#t~malloc1.base, ULTIMATE.start_iterate_#t~malloc2.base, ULTIMATE.start_iterate_~i~0.offset, ULTIMATE.start_iterate_~sum~0.offset, ULTIMATE.start_iterate_~bound_ref~0.base, #length, ULTIMATE.start_iterate_~i~0.base, ULTIMATE.start_iterate_#t~post4, ULTIMATE.start_iterate_#t~malloc2.offset, ULTIMATE.start_iterate_#t~malloc1.offset, ULTIMATE.start_iterate_#t~mem7, ULTIMATE.start_iterate_#t~mem6, ULTIMATE.start_iterate_#in~bound, ULTIMATE.start_main_#res, ULTIMATE.start_iterate_#t~mem9, #valid, ULTIMATE.start_main_#t~ret11, ULTIMATE.start_iterate_#t~mem8, ULTIMATE.start_iterate_#t~mem3, ULTIMATE.start_iterate_#t~mem5, ULTIMATE.start_iterate_~bound, ULTIMATE.start_iterate_~sum~0.base, ULTIMATE.start_iterate_#res] 10#L10true [58] L10-->L10-1: Formula: (and (<= 0 v_ULTIMATE.start_iterate_~bound_ref~0.offset_3) (= 1 (select |v_#valid_7| v_ULTIMATE.start_iterate_~bound_ref~0.base_3)) (<= (+ v_ULTIMATE.start_iterate_~bound_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_iterate_~bound_ref~0.base_3)) (= (store |v_#memory_int_2| v_ULTIMATE.start_iterate_~bound_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_iterate_~bound_ref~0.base_3) v_ULTIMATE.start_iterate_~bound_ref~0.offset_3 v_ULTIMATE.start_iterate_~bound_3)) |v_#memory_int_1|)) InVars {#valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_iterate_~bound_ref~0.offset=v_ULTIMATE.start_iterate_~bound_ref~0.offset_3, ULTIMATE.start_iterate_~bound_ref~0.base=v_ULTIMATE.start_iterate_~bound_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_iterate_~bound=v_ULTIMATE.start_iterate_~bound_3} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_iterate_~bound_ref~0.offset=v_ULTIMATE.start_iterate_~bound_ref~0.offset_3, ULTIMATE.start_iterate_~bound_ref~0.base=v_ULTIMATE.start_iterate_~bound_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_iterate_~bound=v_ULTIMATE.start_iterate_~bound_3} AuxVars[] AssignedVars[#memory_int] 25#L10-1true [77] L10-1-->L11: Formula: (and (= 1 (select |v_#valid_9| v_ULTIMATE.start_iterate_~sum~0.base_3)) (<= 0 v_ULTIMATE.start_iterate_~sum~0.offset_3) (= (store |v_#memory_int_4| v_ULTIMATE.start_iterate_~sum~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_iterate_~sum~0.base_3) v_ULTIMATE.start_iterate_~sum~0.offset_3 0)) |v_#memory_int_3|) (<= (+ v_ULTIMATE.start_iterate_~sum~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_iterate_~sum~0.base_3))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_3, #length=|v_#length_7|, #valid=|v_#valid_9|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_3} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_3, #length=|v_#length_7|, #valid=|v_#valid_9|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_3} AuxVars[] AssignedVars[#memory_int] 29#L11true [82] L11-->L12-8: Formula: (and (= (store |v_#memory_int_6| v_ULTIMATE.start_iterate_~i~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_iterate_~i~0.base_3) v_ULTIMATE.start_iterate_~i~0.offset_3 0)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_iterate_~i~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_iterate_~i~0.base_3)) (<= 0 v_ULTIMATE.start_iterate_~i~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_iterate_~i~0.base_3))) InVars {ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_3, #memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_3, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_3, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 37#L12-8true [2020-06-22 11:16:14,103 INFO L796 eck$LassoCheckResult]: Loop: 37#L12-8true [98] L12-8-->L12-1: Formula: (and (<= 0 v_ULTIMATE.start_iterate_~i~0.offset_5) (= 1 (select |v_#valid_13| v_ULTIMATE.start_iterate_~i~0.base_6)) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_iterate_~i~0.base_6) v_ULTIMATE.start_iterate_~i~0.offset_5) |v_ULTIMATE.start_iterate_#t~mem5_2|) (<= (+ v_ULTIMATE.start_iterate_~i~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_iterate_~i~0.base_6))) InVars {ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_5, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_5, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_iterate_#t~mem5=|v_ULTIMATE.start_iterate_#t~mem5_2|, #length=|v_#length_11|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem5] 12#L12-1true [63] L12-1-->L12-2: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_iterate_~bound_ref~0.base_6)) (<= 0 v_ULTIMATE.start_iterate_~bound_ref~0.offset_5) (<= (+ v_ULTIMATE.start_iterate_~bound_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_iterate_~bound_ref~0.base_6)) (= |v_ULTIMATE.start_iterate_#t~mem6_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_iterate_~bound_ref~0.base_6) v_ULTIMATE.start_iterate_~bound_ref~0.offset_5))) InVars {ULTIMATE.start_iterate_~bound_ref~0.offset=v_ULTIMATE.start_iterate_~bound_ref~0.offset_5, #memory_int=|v_#memory_int_8|, ULTIMATE.start_iterate_~bound_ref~0.base=v_ULTIMATE.start_iterate_~bound_ref~0.base_6, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_iterate_#t~mem6=|v_ULTIMATE.start_iterate_#t~mem6_2|, #valid=|v_#valid_15|, ULTIMATE.start_iterate_~bound_ref~0.offset=v_ULTIMATE.start_iterate_~bound_ref~0.offset_5, #memory_int=|v_#memory_int_8|, ULTIMATE.start_iterate_~bound_ref~0.base=v_ULTIMATE.start_iterate_~bound_ref~0.base_6, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem6] 11#L12-2true [62] L12-2-->L13: Formula: (< |v_ULTIMATE.start_iterate_#t~mem5_6| |v_ULTIMATE.start_iterate_#t~mem6_6|) InVars {ULTIMATE.start_iterate_#t~mem6=|v_ULTIMATE.start_iterate_#t~mem6_6|, ULTIMATE.start_iterate_#t~mem5=|v_ULTIMATE.start_iterate_#t~mem5_6|} OutVars{ULTIMATE.start_iterate_#t~mem6=|v_ULTIMATE.start_iterate_#t~mem6_5|, ULTIMATE.start_iterate_#t~mem5=|v_ULTIMATE.start_iterate_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem6, ULTIMATE.start_iterate_#t~mem5] 35#L13true [91] L13-->L13-1: Formula: (and (<= 0 v_ULTIMATE.start_iterate_~sum~0.offset_5) (= 1 (select |v_#valid_17| v_ULTIMATE.start_iterate_~sum~0.base_6)) (<= (+ v_ULTIMATE.start_iterate_~sum~0.offset_5 4) (select |v_#length_15| v_ULTIMATE.start_iterate_~sum~0.base_6)) (= |v_ULTIMATE.start_iterate_#t~mem7_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_iterate_~sum~0.base_6) v_ULTIMATE.start_iterate_~sum~0.offset_5))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_5, #length=|v_#length_15|, #valid=|v_#valid_17|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_6} OutVars{ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_5, ULTIMATE.start_iterate_#t~mem7=|v_ULTIMATE.start_iterate_#t~mem7_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem7] 33#L13-1true [88] L13-1-->L13-2: Formula: (and (<= (+ v_ULTIMATE.start_iterate_~i~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_iterate_~i~0.base_9)) (<= 0 v_ULTIMATE.start_iterate_~i~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_iterate_~i~0.base_9)) (= |v_ULTIMATE.start_iterate_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_iterate_~i~0.base_9) v_ULTIMATE.start_iterate_~i~0.offset_7))) InVars {ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_7, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_9, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_7, ULTIMATE.start_iterate_#t~mem8=|v_ULTIMATE.start_iterate_#t~mem8_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem8] 30#L13-2true [180] L13-2-->L12-4: Formula: (and (= (store |v_#memory_int_20| v_ULTIMATE.start_iterate_~sum~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_iterate_~sum~0.base_17) v_ULTIMATE.start_iterate_~sum~0.offset_13 (+ |v_ULTIMATE.start_iterate_#t~mem7_6| |v_ULTIMATE.start_iterate_#t~mem8_6|))) |v_#memory_int_19|) (<= (+ v_ULTIMATE.start_iterate_~sum~0.offset_13 4) (select |v_#length_29| v_ULTIMATE.start_iterate_~sum~0.base_17)) (<= 0 v_ULTIMATE.start_iterate_~sum~0.offset_13) (= (select |v_#valid_37| v_ULTIMATE.start_iterate_~sum~0.base_17) 1)) InVars {ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_13, ULTIMATE.start_iterate_#t~mem7=|v_ULTIMATE.start_iterate_#t~mem7_6|, ULTIMATE.start_iterate_#t~mem8=|v_ULTIMATE.start_iterate_#t~mem8_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_20|, #length=|v_#length_29|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_17} OutVars{ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_13, ULTIMATE.start_iterate_#t~mem7=|v_ULTIMATE.start_iterate_#t~mem7_5|, ULTIMATE.start_iterate_#t~mem8=|v_ULTIMATE.start_iterate_#t~mem8_5|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_19|, #length=|v_#length_29|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem7, ULTIMATE.start_iterate_#t~mem8, #memory_int] 23#L12-4true [183] L12-4-->L12-6: Formula: (and (<= 0 v_ULTIMATE.start_iterate_~i~0.offset_13) (<= (+ v_ULTIMATE.start_iterate_~i~0.offset_13 4) (select |v_#length_32| v_ULTIMATE.start_iterate_~i~0.base_18)) (= |v_ULTIMATE.start_iterate_#t~mem3_5| (select (select |v_#memory_int_23| v_ULTIMATE.start_iterate_~i~0.base_18) v_ULTIMATE.start_iterate_~i~0.offset_13)) (= (select |v_#valid_42| v_ULTIMATE.start_iterate_~i~0.base_18) 1) (= |v_ULTIMATE.start_iterate_#t~mem3_5| |v_ULTIMATE.start_iterate_#t~post4_5|)) InVars {ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_13, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, #length=|v_#length_32|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_18} OutVars{ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_13, ULTIMATE.start_iterate_#t~post4=|v_ULTIMATE.start_iterate_#t~post4_5|, #valid=|v_#valid_42|, ULTIMATE.start_iterate_#t~mem3=|v_ULTIMATE.start_iterate_#t~mem3_5|, #memory_int=|v_#memory_int_23|, #length=|v_#length_32|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_18} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~post4, ULTIMATE.start_iterate_#t~mem3] 21#L12-6true [184] L12-6-->L12-8: Formula: (and (<= (+ v_ULTIMATE.start_iterate_~i~0.offset_14 4) (select |v_#length_33| v_ULTIMATE.start_iterate_~i~0.base_19)) (= 1 (select |v_#valid_43| v_ULTIMATE.start_iterate_~i~0.base_19)) (= (store |v_#memory_int_25| v_ULTIMATE.start_iterate_~i~0.base_19 (store (select |v_#memory_int_25| v_ULTIMATE.start_iterate_~i~0.base_19) v_ULTIMATE.start_iterate_~i~0.offset_14 (+ |v_ULTIMATE.start_iterate_#t~post4_7| 1))) |v_#memory_int_24|) (<= 0 v_ULTIMATE.start_iterate_~i~0.offset_14)) InVars {ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_14, ULTIMATE.start_iterate_#t~post4=|v_ULTIMATE.start_iterate_#t~post4_7|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_25|, #length=|v_#length_33|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_19} OutVars{ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_14, ULTIMATE.start_iterate_#t~post4=|v_ULTIMATE.start_iterate_#t~post4_6|, #valid=|v_#valid_43|, ULTIMATE.start_iterate_#t~mem3=|v_ULTIMATE.start_iterate_#t~mem3_6|, #memory_int=|v_#memory_int_24|, #length=|v_#length_33|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~post4, ULTIMATE.start_iterate_#t~mem3, #memory_int] 37#L12-8true [2020-06-22 11:16:14,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:16:14,104 INFO L82 PathProgramCache]: Analyzing trace with hash 107276016, now seen corresponding path program 1 times [2020-06-22 11:16:14,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:16:14,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:16:14,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:14,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:16:14,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:16:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:16:14,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:16:14,149 INFO L82 PathProgramCache]: Analyzing trace with hash -870728200, now seen corresponding path program 1 times [2020-06-22 11:16:14,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:16:14,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:16:14,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:14,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:16:14,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:16:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:16:14,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:16:14,171 INFO L82 PathProgramCache]: Analyzing trace with hash 370951655, now seen corresponding path program 1 times [2020-06-22 11:16:14,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:16:14,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:16:14,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:14,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:16:14,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:16:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:16:14,665 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2020-06-22 11:16:14,783 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-06-22 11:16:14,797 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 11:16:14,798 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 11:16:14,798 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 11:16:14,798 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 11:16:14,798 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 11:16:14,799 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 11:16:14,799 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 11:16:14,799 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 11:16:14,799 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 11:16:14,799 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 11:16:14,799 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 11:16:14,822 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 11:16:14,828 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 11:16:14,831 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 11:16:14,835 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 11:16:14,837 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 11:16:14,839 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 11:16:14,843 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 11:16:14,845 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 11:16:14,849 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 11:16:14,853 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 11:16:14,855 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 11:16:14,861 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 11:16:15,175 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2020-06-22 11:16:15,299 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2020-06-22 11:16:15,300 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 11:16:15,302 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 11:16:15,725 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 11:16:15,730 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 11:16:15,732 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 11:16:15,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:16:15,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:16:15,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:16:15,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:16:15,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:16:15,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:16:15,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:16:15,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:16:15,739 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 11:16:15,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:16:15,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:16:15,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:16:15,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:16:15,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:16:15,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:16:15,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:16:15,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:16:15,742 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 11:16:15,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:16:15,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:16:15,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:16:15,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:16:15,746 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:16:15,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:16:15,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:16:15,749 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 11:16:15,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:16:15,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:16:15,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:16:15,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:16:15,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:16:15,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:16:15,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:16:15,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:16:15,752 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 11:16:15,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:16:15,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:16:15,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:16:15,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:16:15,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:16:15,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:16:15,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:16:15,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:16:15,755 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 11:16:15,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:16:15,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:16:15,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:16:15,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:16:15,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:16:15,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:16:15,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:16:15,763 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 11:16:15,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:16:15,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:16:15,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:16:15,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:16:15,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:16:15,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:16:15,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:16:15,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:16:15,766 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 11:16:15,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:16:15,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:16:15,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:16:15,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:16:15,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:16:15,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:16:15,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:16:15,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:16:15,768 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 11:16:15,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:16:15,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:16:15,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:16:15,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:16:15,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:16:15,771 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:16:15,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:16:15,773 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 11:16:15,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:16:15,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:16:15,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:16:15,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:16:15,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:16:15,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:16:15,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:16:15,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:16:15,776 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 11:16:15,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:16:15,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:16:15,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:16:15,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:16:15,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:16:15,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:16:15,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:16:15,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:16:15,778 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 11:16:15,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:16:15,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:16:15,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:16:15,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:16:15,783 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:16:15,783 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:16:15,820 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 11:16:15,832 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 11:16:15,832 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 11:16:15,835 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 11:16:15,836 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 11:16:15,836 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 11:16:15,837 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_iterate_~i~0.base) ULTIMATE.start_iterate_~i~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_iterate_~bound_ref~0.base) ULTIMATE.start_iterate_~bound_ref~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_iterate_~i~0.base) ULTIMATE.start_iterate_~i~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_iterate_~bound_ref~0.base) ULTIMATE.start_iterate_~bound_ref~0.offset)_1 Supporting invariants [] [2020-06-22 11:16:15,923 INFO L297 tatePredicateManager]: 20 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 11:16:15,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:16:15,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:16:15,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:16:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:16:15,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 11:16:15,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:16:16,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 11:16:16,029 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 11:16:16,030 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:16:16,043 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:16:16,043 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:16:16,043 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:18 [2020-06-22 11:16:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:16:16,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 11:16:16,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:16:16,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 11:16:16,190 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:16:16,190 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 46 [2020-06-22 11:16:16,191 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:16:16,217 INFO L497 ElimStorePlain]: treesize reduction 20, result has 71.4 percent of original size [2020-06-22 11:16:16,218 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:16:16,218 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:54, output treesize:41 [2020-06-22 11:16:16,248 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 11:16:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:16:16,426 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:16:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:16:16,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 11:16:16,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:16:16,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 11:16:16,456 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:16:16,457 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 41 [2020-06-22 11:16:16,458 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:16:16,486 INFO L497 ElimStorePlain]: treesize reduction 20, result has 64.9 percent of original size [2020-06-22 11:16:16,487 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:16:16,487 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:28 [2020-06-22 11:16:16,555 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:16:16,556 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 [2020-06-22 11:16:16,563 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:16:16,638 INFO L497 ElimStorePlain]: treesize reduction 43, result has 51.1 percent of original size [2020-06-22 11:16:16,639 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 11:16:16,640 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:41 [2020-06-22 11:16:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:16:16,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 11:16:16,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:16:16,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 11:16:16,941 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:16:16,942 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 41 [2020-06-22 11:16:16,943 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:16:16,968 INFO L497 ElimStorePlain]: treesize reduction 20, result has 64.9 percent of original size [2020-06-22 11:16:16,969 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:16:16,969 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:28 [2020-06-22 11:16:17,006 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:16:17,006 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 [2020-06-22 11:16:17,012 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:16:17,076 INFO L497 ElimStorePlain]: treesize reduction 43, result has 51.1 percent of original size [2020-06-22 11:16:17,077 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 11:16:17,077 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:41 [2020-06-22 11:16:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:16:17,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 11:16:17,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:16:17,163 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:16:17,163 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 [2020-06-22 11:16:17,170 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:16:17,226 INFO L497 ElimStorePlain]: treesize reduction 47, result has 48.4 percent of original size [2020-06-22 11:16:17,228 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 11:16:17,228 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:41 [2020-06-22 11:16:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:16:17,277 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:16:17,277 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 13 predicates after loop cannibalization [2020-06-22 11:16:17,281 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 13 loop predicates [2020-06-22 11:16:17,282 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 36 states. Second operand 7 states. [2020-06-22 11:16:18,909 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 36 states.. Second operand 7 states. Result 349 states and 592 transitions. Complement of second has 73 states. [2020-06-22 11:16:18,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 5 stem states 14 non-accepting loop states 2 accepting loop states [2020-06-22 11:16:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 11:16:18,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 350 transitions. [2020-06-22 11:16:18,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 350 transitions. Stem has 5 letters. Loop has 8 letters. [2020-06-22 11:16:18,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:16:18,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 350 transitions. Stem has 13 letters. Loop has 8 letters. [2020-06-22 11:16:18,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:16:18,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 350 transitions. Stem has 5 letters. Loop has 16 letters. [2020-06-22 11:16:18,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:16:18,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 349 states and 592 transitions. [2020-06-22 11:16:18,941 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 [2020-06-22 11:16:18,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 349 states to 53 states and 58 transitions. [2020-06-22 11:16:18,944 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2020-06-22 11:16:18,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2020-06-22 11:16:18,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 58 transitions. [2020-06-22 11:16:18,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 11:16:18,946 INFO L706 BuchiCegarLoop]: Abstraction has 53 states and 58 transitions. [2020-06-22 11:16:18,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 58 transitions. [2020-06-22 11:16:18,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 13. [2020-06-22 11:16:18,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 11:16:18,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2020-06-22 11:16:18,948 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-06-22 11:16:18,948 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-06-22 11:16:18,948 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 11:16:18,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2020-06-22 11:16:18,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 11:16:18,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:16:18,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:16:18,950 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 11:16:18,950 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:16:18,951 INFO L794 eck$LassoCheckResult]: Stem: 747#ULTIMATE.startENTRY [81] 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] 743#L-1 [133] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_iterate_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_iterate_#t~malloc1.base_1| 1))) (and (= v_ULTIMATE.start_iterate_~bound_1 |v_ULTIMATE.start_iterate_#in~bound_1|) (= v_ULTIMATE.start_iterate_~bound_ref~0.base_1 |v_ULTIMATE.start_iterate_#t~malloc0.base_1|) (< |v_ULTIMATE.start_iterate_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_iterate_#t~malloc2.base_1| 1) |v_#valid_3|) (> |v_ULTIMATE.start_iterate_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_iterate_~sum~0.base_1 |v_ULTIMATE.start_iterate_#t~malloc2.base_1|) (= |v_ULTIMATE.start_iterate_#in~bound_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (< |v_ULTIMATE.start_iterate_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_iterate_~i~0.base_1 |v_ULTIMATE.start_iterate_#t~malloc1.base_1|) (= v_ULTIMATE.start_iterate_~bound_ref~0.offset_1 |v_ULTIMATE.start_iterate_#t~malloc0.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_iterate_#t~malloc0.base_1|) 0) (< |v_ULTIMATE.start_iterate_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= (select .cse0 |v_ULTIMATE.start_iterate_#t~malloc2.base_1|) 0) (= 0 |v_ULTIMATE.start_iterate_#t~malloc1.offset_1|) (= (store (store (store |v_#length_4| |v_ULTIMATE.start_iterate_#t~malloc0.base_1| 4) |v_ULTIMATE.start_iterate_#t~malloc1.base_1| 4) |v_ULTIMATE.start_iterate_#t~malloc2.base_1| 4) |v_#length_1|) (> |v_ULTIMATE.start_iterate_#t~malloc2.base_1| 0) (= v_ULTIMATE.start_iterate_~sum~0.offset_1 |v_ULTIMATE.start_iterate_#t~malloc2.offset_1|) (= 0 |v_ULTIMATE.start_iterate_#t~malloc0.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_iterate_#t~malloc1.base_1|)) (= 0 |v_ULTIMATE.start_iterate_#t~malloc2.offset_1|) (= v_ULTIMATE.start_iterate_~i~0.offset_1 |v_ULTIMATE.start_iterate_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_iterate_#t~malloc1.base_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_iterate_#t~malloc0.offset=|v_ULTIMATE.start_iterate_#t~malloc0.offset_1|, ULTIMATE.start_iterate_~bound_ref~0.offset=v_ULTIMATE.start_iterate_~bound_ref~0.offset_1, ULTIMATE.start_iterate_#t~malloc0.base=|v_ULTIMATE.start_iterate_#t~malloc0.base_1|, ULTIMATE.start_iterate_#t~malloc1.base=|v_ULTIMATE.start_iterate_#t~malloc1.base_1|, ULTIMATE.start_iterate_#t~malloc2.base=|v_ULTIMATE.start_iterate_#t~malloc2.base_1|, ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_1, ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_1, ULTIMATE.start_iterate_~bound_ref~0.base=v_ULTIMATE.start_iterate_~bound_ref~0.base_1, #length=|v_#length_1|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_1, ULTIMATE.start_iterate_#t~post4=|v_ULTIMATE.start_iterate_#t~post4_1|, ULTIMATE.start_iterate_#t~malloc2.offset=|v_ULTIMATE.start_iterate_#t~malloc2.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_iterate_#t~malloc1.offset=|v_ULTIMATE.start_iterate_#t~malloc1.offset_1|, ULTIMATE.start_iterate_#t~mem7=|v_ULTIMATE.start_iterate_#t~mem7_1|, ULTIMATE.start_iterate_#t~mem6=|v_ULTIMATE.start_iterate_#t~mem6_1|, ULTIMATE.start_iterate_#in~bound=|v_ULTIMATE.start_iterate_#in~bound_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_iterate_#t~mem9=|v_ULTIMATE.start_iterate_#t~mem9_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~ret11=|v_ULTIMATE.start_main_#t~ret11_1|, ULTIMATE.start_iterate_#t~mem8=|v_ULTIMATE.start_iterate_#t~mem8_1|, ULTIMATE.start_iterate_#t~mem3=|v_ULTIMATE.start_iterate_#t~mem3_1|, ULTIMATE.start_iterate_#t~mem5=|v_ULTIMATE.start_iterate_#t~mem5_1|, ULTIMATE.start_iterate_~bound=v_ULTIMATE.start_iterate_~bound_1, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_1, ULTIMATE.start_iterate_#res=|v_ULTIMATE.start_iterate_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_iterate_#t~malloc0.offset, ULTIMATE.start_iterate_~bound_ref~0.offset, ULTIMATE.start_iterate_#t~malloc0.base, ULTIMATE.start_iterate_#t~malloc1.base, ULTIMATE.start_iterate_#t~malloc2.base, ULTIMATE.start_iterate_~i~0.offset, ULTIMATE.start_iterate_~sum~0.offset, ULTIMATE.start_iterate_~bound_ref~0.base, #length, ULTIMATE.start_iterate_~i~0.base, ULTIMATE.start_iterate_#t~post4, ULTIMATE.start_iterate_#t~malloc2.offset, ULTIMATE.start_iterate_#t~malloc1.offset, ULTIMATE.start_iterate_#t~mem7, ULTIMATE.start_iterate_#t~mem6, ULTIMATE.start_iterate_#in~bound, ULTIMATE.start_main_#res, ULTIMATE.start_iterate_#t~mem9, #valid, ULTIMATE.start_main_#t~ret11, ULTIMATE.start_iterate_#t~mem8, ULTIMATE.start_iterate_#t~mem3, ULTIMATE.start_iterate_#t~mem5, ULTIMATE.start_iterate_~bound, ULTIMATE.start_iterate_~sum~0.base, ULTIMATE.start_iterate_#res] 744#L10 [58] L10-->L10-1: Formula: (and (<= 0 v_ULTIMATE.start_iterate_~bound_ref~0.offset_3) (= 1 (select |v_#valid_7| v_ULTIMATE.start_iterate_~bound_ref~0.base_3)) (<= (+ v_ULTIMATE.start_iterate_~bound_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_iterate_~bound_ref~0.base_3)) (= (store |v_#memory_int_2| v_ULTIMATE.start_iterate_~bound_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_iterate_~bound_ref~0.base_3) v_ULTIMATE.start_iterate_~bound_ref~0.offset_3 v_ULTIMATE.start_iterate_~bound_3)) |v_#memory_int_1|)) InVars {#valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_iterate_~bound_ref~0.offset=v_ULTIMATE.start_iterate_~bound_ref~0.offset_3, ULTIMATE.start_iterate_~bound_ref~0.base=v_ULTIMATE.start_iterate_~bound_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_iterate_~bound=v_ULTIMATE.start_iterate_~bound_3} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_iterate_~bound_ref~0.offset=v_ULTIMATE.start_iterate_~bound_ref~0.offset_3, ULTIMATE.start_iterate_~bound_ref~0.base=v_ULTIMATE.start_iterate_~bound_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_iterate_~bound=v_ULTIMATE.start_iterate_~bound_3} AuxVars[] AssignedVars[#memory_int] 741#L10-1 [77] L10-1-->L11: Formula: (and (= 1 (select |v_#valid_9| v_ULTIMATE.start_iterate_~sum~0.base_3)) (<= 0 v_ULTIMATE.start_iterate_~sum~0.offset_3) (= (store |v_#memory_int_4| v_ULTIMATE.start_iterate_~sum~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_iterate_~sum~0.base_3) v_ULTIMATE.start_iterate_~sum~0.offset_3 0)) |v_#memory_int_3|) (<= (+ v_ULTIMATE.start_iterate_~sum~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_iterate_~sum~0.base_3))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_3, #length=|v_#length_7|, #valid=|v_#valid_9|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_3} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_3, #length=|v_#length_7|, #valid=|v_#valid_9|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_3} AuxVars[] AssignedVars[#memory_int] 742#L11 [82] L11-->L12-8: Formula: (and (= (store |v_#memory_int_6| v_ULTIMATE.start_iterate_~i~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_iterate_~i~0.base_3) v_ULTIMATE.start_iterate_~i~0.offset_3 0)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_iterate_~i~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_iterate_~i~0.base_3)) (<= 0 v_ULTIMATE.start_iterate_~i~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_iterate_~i~0.base_3))) InVars {ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_3, #memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_3, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_3, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 739#L12-8 [2020-06-22 11:16:18,951 INFO L796 eck$LassoCheckResult]: Loop: 739#L12-8 [98] L12-8-->L12-1: Formula: (and (<= 0 v_ULTIMATE.start_iterate_~i~0.offset_5) (= 1 (select |v_#valid_13| v_ULTIMATE.start_iterate_~i~0.base_6)) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_iterate_~i~0.base_6) v_ULTIMATE.start_iterate_~i~0.offset_5) |v_ULTIMATE.start_iterate_#t~mem5_2|) (<= (+ v_ULTIMATE.start_iterate_~i~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_iterate_~i~0.base_6))) InVars {ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_5, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_5, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_iterate_#t~mem5=|v_ULTIMATE.start_iterate_#t~mem5_2|, #length=|v_#length_11|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem5] 749#L12-1 [63] L12-1-->L12-2: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_iterate_~bound_ref~0.base_6)) (<= 0 v_ULTIMATE.start_iterate_~bound_ref~0.offset_5) (<= (+ v_ULTIMATE.start_iterate_~bound_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_iterate_~bound_ref~0.base_6)) (= |v_ULTIMATE.start_iterate_#t~mem6_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_iterate_~bound_ref~0.base_6) v_ULTIMATE.start_iterate_~bound_ref~0.offset_5))) InVars {ULTIMATE.start_iterate_~bound_ref~0.offset=v_ULTIMATE.start_iterate_~bound_ref~0.offset_5, #memory_int=|v_#memory_int_8|, ULTIMATE.start_iterate_~bound_ref~0.base=v_ULTIMATE.start_iterate_~bound_ref~0.base_6, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_iterate_#t~mem6=|v_ULTIMATE.start_iterate_#t~mem6_2|, #valid=|v_#valid_15|, ULTIMATE.start_iterate_~bound_ref~0.offset=v_ULTIMATE.start_iterate_~bound_ref~0.offset_5, #memory_int=|v_#memory_int_8|, ULTIMATE.start_iterate_~bound_ref~0.base=v_ULTIMATE.start_iterate_~bound_ref~0.base_6, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem6] 745#L12-2 [62] L12-2-->L13: Formula: (< |v_ULTIMATE.start_iterate_#t~mem5_6| |v_ULTIMATE.start_iterate_#t~mem6_6|) InVars {ULTIMATE.start_iterate_#t~mem6=|v_ULTIMATE.start_iterate_#t~mem6_6|, ULTIMATE.start_iterate_#t~mem5=|v_ULTIMATE.start_iterate_#t~mem5_6|} OutVars{ULTIMATE.start_iterate_#t~mem6=|v_ULTIMATE.start_iterate_#t~mem6_5|, ULTIMATE.start_iterate_#t~mem5=|v_ULTIMATE.start_iterate_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem6, ULTIMATE.start_iterate_#t~mem5] 746#L13 [91] L13-->L13-1: Formula: (and (<= 0 v_ULTIMATE.start_iterate_~sum~0.offset_5) (= 1 (select |v_#valid_17| v_ULTIMATE.start_iterate_~sum~0.base_6)) (<= (+ v_ULTIMATE.start_iterate_~sum~0.offset_5 4) (select |v_#length_15| v_ULTIMATE.start_iterate_~sum~0.base_6)) (= |v_ULTIMATE.start_iterate_#t~mem7_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_iterate_~sum~0.base_6) v_ULTIMATE.start_iterate_~sum~0.offset_5))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_5, #length=|v_#length_15|, #valid=|v_#valid_17|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_6} OutVars{ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_5, ULTIMATE.start_iterate_#t~mem7=|v_ULTIMATE.start_iterate_#t~mem7_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem7] 750#L13-1 [88] L13-1-->L13-2: Formula: (and (<= (+ v_ULTIMATE.start_iterate_~i~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_iterate_~i~0.base_9)) (<= 0 v_ULTIMATE.start_iterate_~i~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_iterate_~i~0.base_9)) (= |v_ULTIMATE.start_iterate_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_iterate_~i~0.base_9) v_ULTIMATE.start_iterate_~i~0.offset_7))) InVars {ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_7, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_9, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_7, ULTIMATE.start_iterate_#t~mem8=|v_ULTIMATE.start_iterate_#t~mem8_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem8] 748#L13-2 [180] L13-2-->L12-4: Formula: (and (= (store |v_#memory_int_20| v_ULTIMATE.start_iterate_~sum~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_iterate_~sum~0.base_17) v_ULTIMATE.start_iterate_~sum~0.offset_13 (+ |v_ULTIMATE.start_iterate_#t~mem7_6| |v_ULTIMATE.start_iterate_#t~mem8_6|))) |v_#memory_int_19|) (<= (+ v_ULTIMATE.start_iterate_~sum~0.offset_13 4) (select |v_#length_29| v_ULTIMATE.start_iterate_~sum~0.base_17)) (<= 0 v_ULTIMATE.start_iterate_~sum~0.offset_13) (= (select |v_#valid_37| v_ULTIMATE.start_iterate_~sum~0.base_17) 1)) InVars {ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_13, ULTIMATE.start_iterate_#t~mem7=|v_ULTIMATE.start_iterate_#t~mem7_6|, ULTIMATE.start_iterate_#t~mem8=|v_ULTIMATE.start_iterate_#t~mem8_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_20|, #length=|v_#length_29|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_17} OutVars{ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_13, ULTIMATE.start_iterate_#t~mem7=|v_ULTIMATE.start_iterate_#t~mem7_5|, ULTIMATE.start_iterate_#t~mem8=|v_ULTIMATE.start_iterate_#t~mem8_5|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_19|, #length=|v_#length_29|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem7, ULTIMATE.start_iterate_#t~mem8, #memory_int] 740#L12-4 [183] L12-4-->L12-6: Formula: (and (<= 0 v_ULTIMATE.start_iterate_~i~0.offset_13) (<= (+ v_ULTIMATE.start_iterate_~i~0.offset_13 4) (select |v_#length_32| v_ULTIMATE.start_iterate_~i~0.base_18)) (= |v_ULTIMATE.start_iterate_#t~mem3_5| (select (select |v_#memory_int_23| v_ULTIMATE.start_iterate_~i~0.base_18) v_ULTIMATE.start_iterate_~i~0.offset_13)) (= (select |v_#valid_42| v_ULTIMATE.start_iterate_~i~0.base_18) 1) (= |v_ULTIMATE.start_iterate_#t~mem3_5| |v_ULTIMATE.start_iterate_#t~post4_5|)) InVars {ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_13, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, #length=|v_#length_32|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_18} OutVars{ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_13, ULTIMATE.start_iterate_#t~post4=|v_ULTIMATE.start_iterate_#t~post4_5|, #valid=|v_#valid_42|, ULTIMATE.start_iterate_#t~mem3=|v_ULTIMATE.start_iterate_#t~mem3_5|, #memory_int=|v_#memory_int_23|, #length=|v_#length_32|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_18} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~post4, ULTIMATE.start_iterate_#t~mem3] 738#L12-6 [184] L12-6-->L12-8: Formula: (and (<= (+ v_ULTIMATE.start_iterate_~i~0.offset_14 4) (select |v_#length_33| v_ULTIMATE.start_iterate_~i~0.base_19)) (= 1 (select |v_#valid_43| v_ULTIMATE.start_iterate_~i~0.base_19)) (= (store |v_#memory_int_25| v_ULTIMATE.start_iterate_~i~0.base_19 (store (select |v_#memory_int_25| v_ULTIMATE.start_iterate_~i~0.base_19) v_ULTIMATE.start_iterate_~i~0.offset_14 (+ |v_ULTIMATE.start_iterate_#t~post4_7| 1))) |v_#memory_int_24|) (<= 0 v_ULTIMATE.start_iterate_~i~0.offset_14)) InVars {ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_14, ULTIMATE.start_iterate_#t~post4=|v_ULTIMATE.start_iterate_#t~post4_7|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_25|, #length=|v_#length_33|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_19} OutVars{ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_14, ULTIMATE.start_iterate_#t~post4=|v_ULTIMATE.start_iterate_#t~post4_6|, #valid=|v_#valid_43|, ULTIMATE.start_iterate_#t~mem3=|v_ULTIMATE.start_iterate_#t~mem3_6|, #memory_int=|v_#memory_int_24|, #length=|v_#length_33|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~post4, ULTIMATE.start_iterate_#t~mem3, #memory_int] 739#L12-8 [2020-06-22 11:16:18,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:16:18,951 INFO L82 PathProgramCache]: Analyzing trace with hash 107454762, now seen corresponding path program 1 times [2020-06-22 11:16:18,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:16:18,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:16:18,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:18,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:16:18,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:16:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:16:18,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:16:18,976 INFO L82 PathProgramCache]: Analyzing trace with hash -870728200, now seen corresponding path program 2 times [2020-06-22 11:16:18,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:16:18,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:16:18,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:18,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:16:18,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:16:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:16:18,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:16:18,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1145447969, now seen corresponding path program 1 times [2020-06-22 11:16:18,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:16:18,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:16:18,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:18,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 11:16:18,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:16:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:16:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:16:19,401 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2020-06-22 11:16:19,506 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-06-22 11:16:19,509 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 11:16:19,509 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 11:16:19,509 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 11:16:19,509 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 11:16:19,509 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 11:16:19,510 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 11:16:19,510 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 11:16:19,510 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 11:16:19,510 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 11:16:19,510 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 11:16:19,510 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 11:16:19,513 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 11:16:19,518 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 11:16:19,519 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 11:16:19,521 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 11:16:19,523 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 11:16:19,524 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 11:16:19,526 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 11:16:19,528 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 11:16:19,530 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 11:16:19,531 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 11:16:19,533 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 11:16:19,534 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 11:16:19,536 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 11:16:19,796 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2020-06-22 11:16:20,265 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 11:16:20,265 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 11:16:20,266 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 11:16:20,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:16:20,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:16:20,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:16:20,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:16:20,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:16:20,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:16:20,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:16:20,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:16:20,269 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 11:16:20,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:16:20,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:16:20,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:16:20,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:16:20,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:16:20,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:16:20,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:16:20,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:16:20,271 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 11:16:20,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:16:20,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:16:20,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:16:20,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:16:20,273 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:16:20,273 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:16:20,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:16:20,275 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 11:16:20,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:16:20,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:16:20,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:16:20,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:16:20,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:16:20,276 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:16:20,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:16:20,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:16:20,277 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 11:16:20,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:16:20,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:16:20,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:16:20,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:16:20,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:16:20,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:16:20,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:16:20,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:16:20,279 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 11:16:20,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:16:20,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:16:20,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:16:20,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:16:20,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:16:20,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:16:20,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:16:20,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:16:20,281 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 11:16:20,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:16:20,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:16:20,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:16:20,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:16:20,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:16:20,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:16:20,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:16:20,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:16:20,283 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 11:16:20,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:16:20,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:16:20,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:16:20,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:16:20,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:16:20,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:16:20,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:16:20,286 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 11:16:20,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:16:20,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:16:20,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:16:20,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:16:20,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:16:20,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:16:20,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:16:20,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:16:20,288 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 11:16:20,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:16:20,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:16:20,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:16:20,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:16:20,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:16:20,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:16:20,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:16:20,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:16:20,290 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 11:16:20,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:16:20,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:16:20,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:16:20,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:16:20,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:16:20,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:16:20,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:16:20,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:16:20,292 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 11:16:20,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:16:20,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:16:20,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:16:20,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:16:20,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:16:20,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:16:20,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:16:20,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:16:20,295 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 11:16:20,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:16:20,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:16:20,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:16:20,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:16:20,296 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:16:20,296 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:16:20,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:16:20,298 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 11:16:20,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:16:20,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:16:20,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:16:20,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:16:20,300 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:16:20,300 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:16:20,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:16:20,306 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 11:16:20,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:16:20,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:16:20,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:16:20,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:16:20,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:16:20,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:16:20,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:16:20,329 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 11:16:20,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:16:20,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:16:20,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:16:20,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:16:20,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:16:20,332 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:16:20,346 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 11:16:20,356 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 11:16:20,356 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 11:16:20,356 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 11:16:20,357 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 11:16:20,358 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 11:16:20,358 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_iterate_~i~0.base) ULTIMATE.start_iterate_~i~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_iterate_~bound_ref~0.base) ULTIMATE.start_iterate_~bound_ref~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_iterate_~i~0.base) ULTIMATE.start_iterate_~i~0.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_iterate_~bound_ref~0.base) ULTIMATE.start_iterate_~bound_ref~0.offset)_2 Supporting invariants [] [2020-06-22 11:16:20,431 INFO L297 tatePredicateManager]: 20 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 11:16:20,438 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:16:20,438 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:16:20,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:16:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:16:20,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 11:16:20,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:16:20,488 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:16:20,489 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2020-06-22 11:16:20,489 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:16:20,501 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:16:20,501 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:16:20,502 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:20 [2020-06-22 11:16:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:16:20,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 11:16:20,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:16:20,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 11:16:20,634 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:16:20,634 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 46 [2020-06-22 11:16:20,635 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:16:20,669 INFO L497 ElimStorePlain]: treesize reduction 20, result has 71.4 percent of original size [2020-06-22 11:16:20,669 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:16:20,670 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:54, output treesize:41 [2020-06-22 11:16:20,711 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 11:16:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:16:20,895 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:16:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:16:20,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 11:16:20,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:16:20,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 11:16:20,929 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:16:20,930 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 41 [2020-06-22 11:16:20,930 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:16:20,953 INFO L497 ElimStorePlain]: treesize reduction 20, result has 64.9 percent of original size [2020-06-22 11:16:20,954 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:16:20,954 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:28 [2020-06-22 11:16:21,014 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:16:21,014 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 [2020-06-22 11:16:21,020 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:16:21,075 INFO L497 ElimStorePlain]: treesize reduction 47, result has 48.4 percent of original size [2020-06-22 11:16:21,075 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 11:16:21,076 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:41 [2020-06-22 11:16:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:16:21,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 11:16:21,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:16:21,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 11:16:21,378 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:16:21,378 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 41 [2020-06-22 11:16:21,379 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:16:21,401 INFO L497 ElimStorePlain]: treesize reduction 20, result has 64.9 percent of original size [2020-06-22 11:16:21,401 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:16:21,401 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:28 [2020-06-22 11:16:21,432 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:16:21,432 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 [2020-06-22 11:16:21,437 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:16:21,500 INFO L497 ElimStorePlain]: treesize reduction 43, result has 51.1 percent of original size [2020-06-22 11:16:21,501 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 11:16:21,501 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:41 [2020-06-22 11:16:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:16:21,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 11:16:21,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:16:21,549 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:16:21,550 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 [2020-06-22 11:16:21,555 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:16:21,607 INFO L497 ElimStorePlain]: treesize reduction 47, result has 48.4 percent of original size [2020-06-22 11:16:21,608 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 11:16:21,608 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:41 [2020-06-22 11:16:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:16:21,625 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 11:16:21,625 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 13 predicates after loop cannibalization [2020-06-22 11:16:21,626 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 13 loop predicates [2020-06-22 11:16:21,626 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 13 states and 18 transitions. cyclomatic complexity: 6 Second operand 7 states. [2020-06-22 11:16:21,784 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 13 states and 18 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 21 states and 27 transitions. Complement of second has 11 states. [2020-06-22 11:16:21,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2020-06-22 11:16:21,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 11:16:21,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2020-06-22 11:16:21,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 5 letters. Loop has 8 letters. [2020-06-22 11:16:21,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:16:21,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 13 letters. Loop has 8 letters. [2020-06-22 11:16:21,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:16:21,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 5 letters. Loop has 16 letters. [2020-06-22 11:16:21,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:16:21,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2020-06-22 11:16:21,792 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 11:16:21,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2020-06-22 11:16:21,792 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 11:16:21,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 11:16:21,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 11:16:21,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 11:16:21,793 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 11:16:21,793 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 11:16:21,793 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 11:16:21,793 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 11:16:21,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 11:16:21,793 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 11:16:21,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 11:16:21,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 11:16:21 BasicIcfg [2020-06-22 11:16:21,799 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 11:16:21,800 INFO L168 Benchmark]: Toolchain (without parser) took 10137.81 ms. Allocated memory was 649.6 MB in the beginning and 848.3 MB in the end (delta: 198.7 MB). Free memory was 565.3 MB in the beginning and 510.5 MB in the end (delta: 54.8 MB). Peak memory consumption was 253.5 MB. Max. memory is 50.3 GB. [2020-06-22 11:16:21,800 INFO L168 Benchmark]: CDTParser took 0.17 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 11:16:21,801 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.76 ms. Allocated memory was 649.6 MB in the beginning and 686.3 MB in the end (delta: 36.7 MB). Free memory was 565.3 MB in the beginning and 650.9 MB in the end (delta: -85.6 MB). Peak memory consumption was 28.9 MB. Max. memory is 50.3 GB. [2020-06-22 11:16:21,801 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.26 ms. Allocated memory is still 686.3 MB. Free memory was 650.9 MB in the beginning and 648.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. [2020-06-22 11:16:21,802 INFO L168 Benchmark]: Boogie Preprocessor took 22.98 ms. Allocated memory is still 686.3 MB. Free memory was 648.1 MB in the beginning and 646.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 11:16:21,802 INFO L168 Benchmark]: RCFGBuilder took 311.83 ms. Allocated memory is still 686.3 MB. Free memory was 646.7 MB in the beginning and 624.3 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 50.3 GB. [2020-06-22 11:16:21,803 INFO L168 Benchmark]: BlockEncodingV2 took 137.07 ms. Allocated memory is still 686.3 MB. Free memory was 624.3 MB in the beginning and 613.6 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-06-22 11:16:21,803 INFO L168 Benchmark]: TraceAbstraction took 1582.78 ms. Allocated memory is still 686.3 MB. Free memory was 612.2 MB in the beginning and 433.8 MB in the end (delta: 178.4 MB). Peak memory consumption was 178.4 MB. Max. memory is 50.3 GB. [2020-06-22 11:16:21,804 INFO L168 Benchmark]: BuchiAutomizer took 7749.92 ms. Allocated memory was 686.3 MB in the beginning and 848.3 MB in the end (delta: 162.0 MB). Free memory was 433.8 MB in the beginning and 510.5 MB in the end (delta: -76.8 MB). Peak memory consumption was 85.2 MB. Max. memory is 50.3 GB. [2020-06-22 11:16:21,808 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 44 locations, 45 edges - StatisticsResult: Encoded RCFG 36 locations, 65 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 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 288.76 ms. Allocated memory was 649.6 MB in the beginning and 686.3 MB in the end (delta: 36.7 MB). Free memory was 565.3 MB in the beginning and 650.9 MB in the end (delta: -85.6 MB). Peak memory consumption was 28.9 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.26 ms. Allocated memory is still 686.3 MB. Free memory was 650.9 MB in the beginning and 648.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 22.98 ms. Allocated memory is still 686.3 MB. Free memory was 648.1 MB in the beginning and 646.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 311.83 ms. Allocated memory is still 686.3 MB. Free memory was 646.7 MB in the beginning and 624.3 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 137.07 ms. Allocated memory is still 686.3 MB. Free memory was 624.3 MB in the beginning and 613.6 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1582.78 ms. Allocated memory is still 686.3 MB. Free memory was 612.2 MB in the beginning and 433.8 MB in the end (delta: 178.4 MB). Peak memory consumption was 178.4 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 7749.92 ms. Allocated memory was 686.3 MB in the beginning and 848.3 MB in the end (delta: 162.0 MB). Free memory was 433.8 MB in the beginning and 510.5 MB in the end (delta: -76.8 MB). Peak memory consumption was 85.2 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: 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: 13]: 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: 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: 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: 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: 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: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 22 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant [2020-06-22 11:16:21,816 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:16:21,816 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:16:21,816 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:16:21,817 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:16:21,817 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:16:21,818 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((0 == i && \valid[i] == 1) && bound_ref == 0) && 4 == unknown-#length-unknown[bound_ref]) && sum == 0) && unknown-#length-unknown[i] == 4) && 4 == unknown-#length-unknown[sum]) && \valid[sum] == 1) && \valid[bound_ref] == 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 22 error locations. SAFE Result, 1.5s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 38 SDtfs, 307 SDslu, 6 SDs, 0 SdLazy, 362 SolverSat, 98 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred 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, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 40 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 367 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 (0 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] + unknown-#memory_int-unknown[bound_ref][bound_ref] and consists of 21 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] + unknown-#memory_int-unknown[bound_ref][bound_ref] and consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.3s. Construction of modules took 0.8s. Büchi inclusion checks took 3.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 40 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 13 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 8 SDtfs, 1046 SDslu, 103 SDs, 0 SdLazy, 1271 SolverSat, 127 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital314 mio100 ax100 hnf100 lsp97 ukn57 mio100 lsp39 div100 bol100 ite100 ukn100 eq188 hnf88 smp98 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! !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 11:16:22.041 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check