./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7ed84bee4308b8cf5be51a33ec471886cd45cc40 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:00:23,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:00:23,308 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:00:23,326 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:00:23,327 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:00:23,329 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:00:23,331 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:00:23,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:00:23,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:00:23,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:00:23,350 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:00:23,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:00:23,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:00:23,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:00:23,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:00:23,355 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:00:23,356 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:00:23,357 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:00:23,358 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:00:23,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:00:23,362 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:00:23,363 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:00:23,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:00:23,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:00:23,368 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:00:23,368 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:00:23,369 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:00:23,370 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:00:23,370 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:00:23,371 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:00:23,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:00:23,373 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:00:23,373 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:00:23,374 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:00:23,375 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:00:23,376 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:00:23,377 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:00:23,377 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:00:23,377 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:00:23,378 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:00:23,379 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:00:23,381 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 03:00:23,397 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:00:23,398 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:00:23,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:00:23,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:00:23,400 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:00:23,400 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:00:23,400 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:00:23,401 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:00:23,401 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:00:23,401 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:00:23,401 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:00:23,402 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:00:23,402 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:00:23,402 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:00:23,403 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:00:23,403 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:00:23,403 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:00:23,403 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:00:23,404 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:00:23,404 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:00:23,404 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:00:23,404 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:00:23,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:00:23,405 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:00:23,405 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:00:23,406 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:00:23,406 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:00:23,406 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:00:23,407 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:00:23,408 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7ed84bee4308b8cf5be51a33ec471886cd45cc40 [2019-11-28 03:00:23,702 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:00:23,720 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:00:23,723 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:00:23,725 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:00:23,726 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:00:23,727 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca.i [2019-11-28 03:00:23,803 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce81138f6/2fe173ebac384ba1bf1eb3ad54b778df/FLAGf210900d2 [2019-11-28 03:00:24,313 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:00:24,313 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca.i [2019-11-28 03:00:24,330 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce81138f6/2fe173ebac384ba1bf1eb3ad54b778df/FLAGf210900d2 [2019-11-28 03:00:24,655 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce81138f6/2fe173ebac384ba1bf1eb3ad54b778df [2019-11-28 03:00:24,660 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:00:24,661 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:00:24,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:00:24,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:00:24,667 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:00:24,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:00:24" (1/1) ... [2019-11-28 03:00:24,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ec85d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:24, skipping insertion in model container [2019-11-28 03:00:24,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:00:24" (1/1) ... [2019-11-28 03:00:24,680 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:00:24,734 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:00:25,133 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:00:25,150 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:00:25,197 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:00:25,256 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:00:25,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:25 WrapperNode [2019-11-28 03:00:25,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:00:25,258 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:00:25,258 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:00:25,258 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:00:25,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:25" (1/1) ... [2019-11-28 03:00:25,283 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:25" (1/1) ... [2019-11-28 03:00:25,311 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:00:25,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:00:25,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:00:25,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:00:25,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:25" (1/1) ... [2019-11-28 03:00:25,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:25" (1/1) ... [2019-11-28 03:00:25,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:25" (1/1) ... [2019-11-28 03:00:25,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:25" (1/1) ... [2019-11-28 03:00:25,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:25" (1/1) ... [2019-11-28 03:00:25,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:25" (1/1) ... [2019-11-28 03:00:25,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:25" (1/1) ... [2019-11-28 03:00:25,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:00:25,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:00:25,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:00:25,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:00:25,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:25,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:00:25,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:00:25,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:00:25,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:00:25,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:00:25,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:00:25,861 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:00:25,862 INFO L297 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 03:00:25,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:00:25 BoogieIcfgContainer [2019-11-28 03:00:25,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:00:25,864 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:00:25,865 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:00:25,868 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:00:25,869 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:00:25,870 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:00:24" (1/3) ... [2019-11-28 03:00:25,871 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26b8cc44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:00:25, skipping insertion in model container [2019-11-28 03:00:25,871 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:00:25,871 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:25" (2/3) ... [2019-11-28 03:00:25,872 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26b8cc44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:00:25, skipping insertion in model container [2019-11-28 03:00:25,872 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:00:25,872 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:00:25" (3/3) ... [2019-11-28 03:00:25,874 INFO L371 chiAutomizerObserver]: Analyzing ICFG Toulouse-MultiBranchesToLoop-alloca.i [2019-11-28 03:00:25,923 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:00:25,923 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:00:25,923 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:00:25,924 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:00:25,925 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:00:25,925 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:00:25,925 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:00:25,926 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:00:25,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2019-11-28 03:00:25,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:00:25,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:25,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:25,975 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:00:25,975 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:00:25,976 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:00:25,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2019-11-28 03:00:25,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:00:25,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:25,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:25,981 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:00:25,981 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:00:25,989 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 7#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 22#L553true assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 25#L553-2true call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 17#L558true assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; 19#L558-2true call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 9#L563true assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post17;havoc main_#t~mem16; 13#L563-2true call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3#L568true assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post22;havoc main_#t~mem21; 5#L568-2true call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 24#L573true assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; 27#L573-2true call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 18#L578true assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 21#L578-2true call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 11#L583true assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 16#L583-2true call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 4#L588true assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 6#L588-2true call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 26#L593true assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 10#L598-4true [2019-11-28 03:00:25,989 INFO L796 eck$LassoCheckResult]: Loop: 10#L598-4true call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 20#L598true assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 8#L598-2true assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem54;havoc main_#t~mem53; 10#L598-4true [2019-11-28 03:00:25,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:25,995 INFO L82 PathProgramCache]: Analyzing trace with hash 187436106, now seen corresponding path program 1 times [2019-11-28 03:00:26,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:26,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207886348] [2019-11-28 03:00:26,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:26,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:00:26,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207886348] [2019-11-28 03:00:26,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:00:26,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:00:26,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226694485] [2019-11-28 03:00:26,276 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:00:26,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:26,277 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 1 times [2019-11-28 03:00:26,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:26,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485146986] [2019-11-28 03:00:26,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:26,403 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:26,624 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-28 03:00:26,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:00:26,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:00:26,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:00:26,744 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 5 states. [2019-11-28 03:00:26,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:00:26,955 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2019-11-28 03:00:26,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:00:26,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 49 transitions. [2019-11-28 03:00:26,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:00:26,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 29 states and 41 transitions. [2019-11-28 03:00:26,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-28 03:00:26,971 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-28 03:00:26,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 41 transitions. [2019-11-28 03:00:26,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:00:26,972 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 41 transitions. [2019-11-28 03:00:26,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 41 transitions. [2019-11-28 03:00:27,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2019-11-28 03:00:27,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 03:00:27,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2019-11-28 03:00:27,007 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2019-11-28 03:00:27,008 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2019-11-28 03:00:27,008 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:00:27,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 34 transitions. [2019-11-28 03:00:27,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:00:27,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:27,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:27,011 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:00:27,011 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:00:27,012 INFO L794 eck$LassoCheckResult]: Stem: 94#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 91#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 92#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 93#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 76#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; 77#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 82#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post17;havoc main_#t~mem16; 95#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 78#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post22;havoc main_#t~mem21; 79#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 87#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; 96#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 80#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 81#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 88#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem36;havoc main_#t~post37; 97#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 99#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 84#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 89#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 90#L598-4 [2019-11-28 03:00:27,012 INFO L796 eck$LassoCheckResult]: Loop: 90#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 85#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 86#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem54;havoc main_#t~mem53; 90#L598-4 [2019-11-28 03:00:27,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:27,013 INFO L82 PathProgramCache]: Analyzing trace with hash 189283148, now seen corresponding path program 1 times [2019-11-28 03:00:27,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:27,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125111063] [2019-11-28 03:00:27,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:27,120 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:27,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:27,124 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 2 times [2019-11-28 03:00:27,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:27,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101436792] [2019-11-28 03:00:27,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:27,207 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:27,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:27,207 INFO L82 PathProgramCache]: Analyzing trace with hash -357729952, now seen corresponding path program 1 times [2019-11-28 03:00:27,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:27,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043137300] [2019-11-28 03:00:27,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:27,339 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:27,528 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-28 03:00:32,534 WARN L192 SmtUtils]: Spent 4.94 s on a formula simplification. DAG size of input: 192 DAG size of output: 163 [2019-11-28 03:00:32,781 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-28 03:00:32,794 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:00:32,795 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:00:32,799 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:00:32,799 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:00:32,799 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:00:32,799 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:32,800 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:00:32,800 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:00:32,800 INFO L133 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop-alloca.i_Iteration2_Lasso [2019-11-28 03:00:32,801 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:00:32,801 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:00:32,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:32,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:32,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:32,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:32,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:32,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:32,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:32,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:32,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:32,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:32,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:32,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:32,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:32,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:32,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,501 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-11-28 03:00:33,667 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-11-28 03:00:33,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:33,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:34,500 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:00:34,506 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:34,525 INFO L120 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 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:34,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:34,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:34,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:34,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:34,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:34,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:34,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:34,535 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:34,548 INFO L120 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 [2019-11-28 03:00:34,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:34,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:34,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:34,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:34,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:34,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:34,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:34,559 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:34,572 INFO L120 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 [2019-11-28 03:00:34,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:34,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:34,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:34,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:34,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:34,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:34,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:34,584 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:34,592 INFO L120 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 [2019-11-28 03:00:34,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:34,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:34,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:34,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:34,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:34,595 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:34,596 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:34,598 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:34,605 INFO L120 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 [2019-11-28 03:00:34,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:34,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:34,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:34,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:34,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:34,608 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:34,608 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:34,610 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:34,623 INFO L120 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 [2019-11-28 03:00:34,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:34,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:34,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:34,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:34,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:34,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:34,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:34,627 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:34,638 INFO L120 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 [2019-11-28 03:00:34,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:34,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:34,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:34,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:34,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:34,640 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:34,640 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:34,641 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:34,648 INFO L120 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 [2019-11-28 03:00:34,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:34,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:34,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:34,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:34,654 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:00:34,654 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:00:34,672 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:34,690 INFO L120 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 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:34,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:34,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:34,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:34,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:34,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:34,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:34,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:34,694 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:34,700 INFO L120 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 [2019-11-28 03:00:34,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:34,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:34,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:34,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:34,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:34,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:34,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:34,703 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:34,714 INFO L120 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 [2019-11-28 03:00:34,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:34,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:34,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:34,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:34,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:34,716 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:34,716 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:34,717 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:34,723 INFO L120 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 [2019-11-28 03:00:34,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:34,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:34,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:34,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:34,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:34,726 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:34,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:34,728 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:34,735 INFO L120 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 [2019-11-28 03:00:34,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:34,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:34,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:34,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:34,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:34,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:34,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:34,739 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:34,748 INFO L120 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 [2019-11-28 03:00:34,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:34,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:34,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:34,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:34,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:34,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:34,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:34,752 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:34,759 INFO L120 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 [2019-11-28 03:00:34,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:34,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:34,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:34,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:34,764 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:00:34,764 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:00:34,771 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:34,788 INFO L120 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 [2019-11-28 03:00:34,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:34,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:34,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:34,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:34,794 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:00:34,794 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:00:34,800 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:34,815 INFO L120 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 [2019-11-28 03:00:34,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:34,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:34,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:34,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:34,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:00:34,827 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:34,840 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:34,852 INFO L120 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 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:34,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:34,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:34,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:34,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:34,859 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:00:34,859 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:00:34,869 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:00:34,901 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-28 03:00:34,901 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:34,909 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:00:34,912 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 03:00:34,913 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:00:34,914 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1 + 100 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 - 2 >= 0] [2019-11-28 03:00:35,180 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2019-11-28 03:00:35,196 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 03:00:35,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:35,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-28 03:00:35,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:00:35,334 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:00:35,335 INFO L377 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 35 treesize of output 39 [2019-11-28 03:00:35,336 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:00:35,354 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:00:35,355 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:00:35,355 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:13 [2019-11-28 03:00:35,384 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 03:00:35,385 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:00:35,395 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:00:35,396 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:00:35,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-28 03:00:35,427 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-28 03:00:35,428 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:00:35,440 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:00:35,440 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:00:35,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2019-11-28 03:00:35,473 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-28 03:00:35,473 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 03:00:35,517 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:00:35,518 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:00:35,518 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2019-11-28 03:00:35,565 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-28 03:00:35,571 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:00:35,585 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:00:35,586 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:00:35,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2019-11-28 03:00:35,630 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-28 03:00:35,631 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:00:35,641 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:00:35,643 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:00:35,644 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2019-11-28 03:00:35,682 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-28 03:00:35,683 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:00:35,692 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:00:35,693 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:00:35,693 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2019-11-28 03:00:35,728 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-28 03:00:35,729 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:00:35,739 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:00:35,739 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:00:35,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2019-11-28 03:00:35,788 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-28 03:00:35,789 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:00:35,799 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:00:35,799 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:00:35,799 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2019-11-28 03:00:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:35,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 03:00:35,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:00:35,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:00:35,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:00:35,914 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2019-11-28 03:00:35,915 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 11 Second operand 13 states. [2019-11-28 03:00:36,972 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 11. Second operand 13 states. Result 91 states and 129 transitions. Complement of second has 17 states. [2019-11-28 03:00:36,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2019-11-28 03:00:36,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 03:00:36,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 111 transitions. [2019-11-28 03:00:36,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 111 transitions. Stem has 19 letters. Loop has 3 letters. [2019-11-28 03:00:36,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:00:36,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 111 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-28 03:00:36,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:00:36,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 111 transitions. Stem has 19 letters. Loop has 6 letters. [2019-11-28 03:00:36,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:00:36,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 129 transitions. [2019-11-28 03:00:36,984 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 03:00:36,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 85 states and 116 transitions. [2019-11-28 03:00:36,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2019-11-28 03:00:36,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2019-11-28 03:00:36,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 116 transitions. [2019-11-28 03:00:36,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:00:36,987 INFO L688 BuchiCegarLoop]: Abstraction has 85 states and 116 transitions. [2019-11-28 03:00:36,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 116 transitions. [2019-11-28 03:00:36,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 52. [2019-11-28 03:00:36,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 03:00:36,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2019-11-28 03:00:36,995 INFO L711 BuchiCegarLoop]: Abstraction has 52 states and 74 transitions. [2019-11-28 03:00:36,995 INFO L591 BuchiCegarLoop]: Abstraction has 52 states and 74 transitions. [2019-11-28 03:00:36,995 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:00:36,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 74 transitions. [2019-11-28 03:00:36,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:00:36,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:36,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:36,997 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:00:36,998 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:00:36,998 INFO L794 eck$LassoCheckResult]: Stem: 499#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 495#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 496#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 497#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 528#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; 479#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 500#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post17;havoc main_#t~mem16; 501#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 507#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post22;havoc main_#t~mem21; 523#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 521#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; 520#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 518#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 515#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 514#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem36;havoc main_#t~post37; 513#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 512#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 511#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 510#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 494#L598-4 [2019-11-28 03:00:36,998 INFO L796 eck$LassoCheckResult]: Loop: 494#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 489#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 490#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem54;havoc main_#t~mem53; 494#L598-4 [2019-11-28 03:00:36,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:36,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1777631050, now seen corresponding path program 1 times [2019-11-28 03:00:36,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:36,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180179790] [2019-11-28 03:00:36,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:37,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:00:37,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180179790] [2019-11-28 03:00:37,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:00:37,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:00:37,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122139198] [2019-11-28 03:00:37,044 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:00:37,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:37,044 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 3 times [2019-11-28 03:00:37,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:37,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775023294] [2019-11-28 03:00:37,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:37,089 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:37,225 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-28 03:00:37,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:00:37,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:00:37,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:00:37,284 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. cyclomatic complexity: 23 Second operand 4 states. [2019-11-28 03:00:37,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:00:37,338 INFO L93 Difference]: Finished difference Result 52 states and 73 transitions. [2019-11-28 03:00:37,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:00:37,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 73 transitions. [2019-11-28 03:00:37,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:00:37,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 73 transitions. [2019-11-28 03:00:37,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2019-11-28 03:00:37,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2019-11-28 03:00:37,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 73 transitions. [2019-11-28 03:00:37,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:00:37,343 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 73 transitions. [2019-11-28 03:00:37,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 73 transitions. [2019-11-28 03:00:37,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-11-28 03:00:37,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 03:00:37,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 73 transitions. [2019-11-28 03:00:37,347 INFO L711 BuchiCegarLoop]: Abstraction has 52 states and 73 transitions. [2019-11-28 03:00:37,347 INFO L591 BuchiCegarLoop]: Abstraction has 52 states and 73 transitions. [2019-11-28 03:00:37,347 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:00:37,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 73 transitions. [2019-11-28 03:00:37,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:00:37,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:37,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:37,349 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:00:37,350 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:00:37,350 INFO L794 eck$LassoCheckResult]: Stem: 611#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 606#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 607#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 609#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 591#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 592#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 597#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post17;havoc main_#t~mem16; 612#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 593#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post22;havoc main_#t~mem21; 594#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 600#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; 613#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 595#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 596#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 603#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem36;havoc main_#t~post37; 615#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 620#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 604#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 605#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 608#L598-4 [2019-11-28 03:00:37,350 INFO L796 eck$LassoCheckResult]: Loop: 608#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 601#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 602#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem54;havoc main_#t~mem53; 608#L598-4 [2019-11-28 03:00:37,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:37,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1237472568, now seen corresponding path program 1 times [2019-11-28 03:00:37,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:37,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234961064] [2019-11-28 03:00:37,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:37,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:00:37,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234961064] [2019-11-28 03:00:37,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:00:37,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:00:37,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999088811] [2019-11-28 03:00:37,417 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:00:37,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:37,418 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 4 times [2019-11-28 03:00:37,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:37,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781856438] [2019-11-28 03:00:37,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:37,468 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:37,601 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-28 03:00:37,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:00:37,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:00:37,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:00:37,644 INFO L87 Difference]: Start difference. First operand 52 states and 73 transitions. cyclomatic complexity: 22 Second operand 5 states. [2019-11-28 03:00:37,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:00:37,851 INFO L93 Difference]: Finished difference Result 65 states and 90 transitions. [2019-11-28 03:00:37,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:00:37,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 90 transitions. [2019-11-28 03:00:37,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:00:37,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 90 transitions. [2019-11-28 03:00:37,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2019-11-28 03:00:37,855 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2019-11-28 03:00:37,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 90 transitions. [2019-11-28 03:00:37,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:00:37,856 INFO L688 BuchiCegarLoop]: Abstraction has 65 states and 90 transitions. [2019-11-28 03:00:37,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 90 transitions. [2019-11-28 03:00:37,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2019-11-28 03:00:37,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 03:00:37,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 72 transitions. [2019-11-28 03:00:37,860 INFO L711 BuchiCegarLoop]: Abstraction has 52 states and 72 transitions. [2019-11-28 03:00:37,860 INFO L591 BuchiCegarLoop]: Abstraction has 52 states and 72 transitions. [2019-11-28 03:00:37,860 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:00:37,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 72 transitions. [2019-11-28 03:00:37,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:00:37,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:37,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:37,862 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:00:37,863 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:00:37,863 INFO L794 eck$LassoCheckResult]: Stem: 738#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 733#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 734#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 736#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 718#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 719#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 725#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post15;havoc main_#t~mem14; 739#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 720#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post22;havoc main_#t~mem21; 721#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 728#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; 740#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 769#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 723#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 742#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem36;havoc main_#t~post37; 743#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 752#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 727#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 732#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 735#L598-4 [2019-11-28 03:00:37,863 INFO L796 eck$LassoCheckResult]: Loop: 735#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 729#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 730#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem54;havoc main_#t~mem53; 735#L598-4 [2019-11-28 03:00:37,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:37,863 INFO L82 PathProgramCache]: Analyzing trace with hash -650666554, now seen corresponding path program 1 times [2019-11-28 03:00:37,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:37,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824991377] [2019-11-28 03:00:37,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:00:37,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824991377] [2019-11-28 03:00:37,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:00:37,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:00:37,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914727073] [2019-11-28 03:00:37,935 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:00:37,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:37,936 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 5 times [2019-11-28 03:00:37,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:37,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129537510] [2019-11-28 03:00:37,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:37,978 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:38,106 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-28 03:00:38,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:00:38,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:00:38,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:00:38,146 INFO L87 Difference]: Start difference. First operand 52 states and 72 transitions. cyclomatic complexity: 21 Second operand 5 states. [2019-11-28 03:00:38,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:00:38,290 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2019-11-28 03:00:38,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:00:38,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 85 transitions. [2019-11-28 03:00:38,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:00:38,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 63 states and 85 transitions. [2019-11-28 03:00:38,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2019-11-28 03:00:38,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2019-11-28 03:00:38,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 85 transitions. [2019-11-28 03:00:38,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:00:38,295 INFO L688 BuchiCegarLoop]: Abstraction has 63 states and 85 transitions. [2019-11-28 03:00:38,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 85 transitions. [2019-11-28 03:00:38,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 50. [2019-11-28 03:00:38,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 03:00:38,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2019-11-28 03:00:38,300 INFO L711 BuchiCegarLoop]: Abstraction has 50 states and 68 transitions. [2019-11-28 03:00:38,300 INFO L591 BuchiCegarLoop]: Abstraction has 50 states and 68 transitions. [2019-11-28 03:00:38,300 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:00:38,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 68 transitions. [2019-11-28 03:00:38,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:00:38,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:38,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:38,301 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:00:38,301 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:00:38,302 INFO L794 eck$LassoCheckResult]: Stem: 863#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 858#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 859#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 861#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 843#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 844#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 864#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post15;havoc main_#t~mem14; 865#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 845#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post20;havoc main_#t~mem19; 846#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 853#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; 866#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 847#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 848#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 856#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem36;havoc main_#t~post37; 868#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 875#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 852#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 857#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 860#L598-4 [2019-11-28 03:00:38,302 INFO L796 eck$LassoCheckResult]: Loop: 860#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 854#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 855#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem54;havoc main_#t~mem53; 860#L598-4 [2019-11-28 03:00:38,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:38,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1351731132, now seen corresponding path program 1 times [2019-11-28 03:00:38,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:38,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191500384] [2019-11-28 03:00:38,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:38,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:00:38,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191500384] [2019-11-28 03:00:38,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:00:38,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:00:38,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811541269] [2019-11-28 03:00:38,350 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:00:38,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:38,350 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 6 times [2019-11-28 03:00:38,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:38,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625561733] [2019-11-28 03:00:38,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:38,370 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:38,508 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-28 03:00:38,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:00:38,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:00:38,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:00:38,548 INFO L87 Difference]: Start difference. First operand 50 states and 68 transitions. cyclomatic complexity: 19 Second operand 5 states. [2019-11-28 03:00:38,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:00:38,693 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2019-11-28 03:00:38,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:00:38,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 78 transitions. [2019-11-28 03:00:38,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:00:38,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 78 transitions. [2019-11-28 03:00:38,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2019-11-28 03:00:38,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2019-11-28 03:00:38,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 78 transitions. [2019-11-28 03:00:38,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:00:38,697 INFO L688 BuchiCegarLoop]: Abstraction has 59 states and 78 transitions. [2019-11-28 03:00:38,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 78 transitions. [2019-11-28 03:00:38,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2019-11-28 03:00:38,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 03:00:38,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2019-11-28 03:00:38,701 INFO L711 BuchiCegarLoop]: Abstraction has 50 states and 66 transitions. [2019-11-28 03:00:38,701 INFO L591 BuchiCegarLoop]: Abstraction has 50 states and 66 transitions. [2019-11-28 03:00:38,701 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:00:38,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 66 transitions. [2019-11-28 03:00:38,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:00:38,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:38,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:38,704 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:00:38,704 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:00:38,705 INFO L794 eck$LassoCheckResult]: Stem: 981#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 976#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 977#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 979#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 962#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 963#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 968#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post15;havoc main_#t~mem14; 982#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 964#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post20;havoc main_#t~mem19; 965#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 971#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem24;havoc main_#t~post25; 983#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 966#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 967#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 974#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem36;havoc main_#t~post37; 985#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1011#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 970#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 975#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 978#L598-4 [2019-11-28 03:00:38,705 INFO L796 eck$LassoCheckResult]: Loop: 978#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 972#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 973#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem54;havoc main_#t~mem53; 978#L598-4 [2019-11-28 03:00:38,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:38,705 INFO L82 PathProgramCache]: Analyzing trace with hash -2031789502, now seen corresponding path program 1 times [2019-11-28 03:00:38,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:38,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561071873] [2019-11-28 03:00:38,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:38,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:00:38,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561071873] [2019-11-28 03:00:38,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:00:38,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:00:38,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7380565] [2019-11-28 03:00:38,753 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:00:38,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:38,754 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 7 times [2019-11-28 03:00:38,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:38,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591969375] [2019-11-28 03:00:38,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:38,773 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:38,902 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-28 03:00:38,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:00:38,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:00:38,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:00:38,951 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-11-28 03:00:39,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:00:39,095 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2019-11-28 03:00:39,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:00:39,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 70 transitions. [2019-11-28 03:00:39,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:00:39,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 70 transitions. [2019-11-28 03:00:39,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2019-11-28 03:00:39,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2019-11-28 03:00:39,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 70 transitions. [2019-11-28 03:00:39,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:00:39,106 INFO L688 BuchiCegarLoop]: Abstraction has 55 states and 70 transitions. [2019-11-28 03:00:39,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 70 transitions. [2019-11-28 03:00:39,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2019-11-28 03:00:39,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 03:00:39,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2019-11-28 03:00:39,112 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 59 transitions. [2019-11-28 03:00:39,112 INFO L591 BuchiCegarLoop]: Abstraction has 46 states and 59 transitions. [2019-11-28 03:00:39,113 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 03:00:39,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 59 transitions. [2019-11-28 03:00:39,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:00:39,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:39,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:39,114 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:00:39,114 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:00:39,115 INFO L794 eck$LassoCheckResult]: Stem: 1095#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1090#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1091#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 1092#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1075#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 1076#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1081#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post15;havoc main_#t~mem14; 1094#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1077#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post20;havoc main_#t~mem19; 1078#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1084#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem24;havoc main_#t~post25; 1096#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1104#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post30;havoc main_#t~mem29; 1113#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1098#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem36;havoc main_#t~post37; 1099#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1120#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 1083#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1088#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 1089#L598-4 [2019-11-28 03:00:39,115 INFO L796 eck$LassoCheckResult]: Loop: 1089#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1085#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1086#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem54;havoc main_#t~mem53; 1089#L598-4 [2019-11-28 03:00:39,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:39,115 INFO L82 PathProgramCache]: Analyzing trace with hash 488170432, now seen corresponding path program 1 times [2019-11-28 03:00:39,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:39,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178580185] [2019-11-28 03:00:39,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:00:39,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178580185] [2019-11-28 03:00:39,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:00:39,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:00:39,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479760197] [2019-11-28 03:00:39,165 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:00:39,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:39,166 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 8 times [2019-11-28 03:00:39,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:39,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937974501] [2019-11-28 03:00:39,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:39,205 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:39,365 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-28 03:00:39,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:00:39,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:00:39,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:00:39,424 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-11-28 03:00:39,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:00:39,530 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2019-11-28 03:00:39,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:00:39,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 64 transitions. [2019-11-28 03:00:39,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:00:39,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 64 transitions. [2019-11-28 03:00:39,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2019-11-28 03:00:39,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2019-11-28 03:00:39,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 64 transitions. [2019-11-28 03:00:39,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:00:39,535 INFO L688 BuchiCegarLoop]: Abstraction has 53 states and 64 transitions. [2019-11-28 03:00:39,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 64 transitions. [2019-11-28 03:00:39,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2019-11-28 03:00:39,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 03:00:39,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-11-28 03:00:39,538 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-11-28 03:00:39,538 INFO L591 BuchiCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-11-28 03:00:39,538 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 03:00:39,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 52 transitions. [2019-11-28 03:00:39,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:00:39,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:39,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:39,540 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:00:39,540 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:00:39,540 INFO L794 eck$LassoCheckResult]: Stem: 1202#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1198#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1199#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 1200#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1182#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 1183#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1190#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post15;havoc main_#t~mem14; 1203#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1184#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post20;havoc main_#t~mem19; 1185#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1204#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem24;havoc main_#t~post25; 1205#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1186#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post30;havoc main_#t~mem29; 1187#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1195#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 1215#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1214#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 1213#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1212#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43;call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post47 := main_#t~mem46;call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem46;havoc main_#t~post47; 1197#L598-4 [2019-11-28 03:00:39,540 INFO L796 eck$LassoCheckResult]: Loop: 1197#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1191#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1192#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem54;havoc main_#t~mem53; 1197#L598-4 [2019-11-28 03:00:39,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:39,541 INFO L82 PathProgramCache]: Analyzing trace with hash 486321468, now seen corresponding path program 1 times [2019-11-28 03:00:39,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:39,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225727536] [2019-11-28 03:00:39,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:39,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:00:39,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225727536] [2019-11-28 03:00:39,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:00:39,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 03:00:39,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277099877] [2019-11-28 03:00:39,607 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:00:39,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:39,608 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 9 times [2019-11-28 03:00:39,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:39,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880863932] [2019-11-28 03:00:39,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:39,625 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:39,778 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-28 03:00:39,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:00:39,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 03:00:39,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 03:00:39,833 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. cyclomatic complexity: 11 Second operand 7 states. [2019-11-28 03:00:39,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:00:39,939 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2019-11-28 03:00:39,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:00:39,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 57 transitions. [2019-11-28 03:00:39,941 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:00:39,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 57 transitions. [2019-11-28 03:00:39,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2019-11-28 03:00:39,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2019-11-28 03:00:39,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 57 transitions. [2019-11-28 03:00:39,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:00:39,942 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2019-11-28 03:00:39,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 57 transitions. [2019-11-28 03:00:39,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2019-11-28 03:00:39,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 03:00:39,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2019-11-28 03:00:39,945 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-11-28 03:00:39,945 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-11-28 03:00:39,945 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 03:00:39,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2019-11-28 03:00:39,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:00:39,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:39,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:39,946 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:00:39,946 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:00:39,947 INFO L794 eck$LassoCheckResult]: Stem: 1302#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1298#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1299#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 1300#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1283#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post10 := main_#t~mem9;call write~int(1 + main_#t~post10, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post10;havoc main_#t~mem9; 1284#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1289#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post15;havoc main_#t~mem14; 1303#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1285#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post20;havoc main_#t~mem19; 1286#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1294#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem24;havoc main_#t~post25; 1304#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1287#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post30;havoc main_#t~mem29; 1288#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1295#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 1306#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1290#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 1291#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1296#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem44;havoc main_#t~post45; 1297#L598-4 [2019-11-28 03:00:39,947 INFO L796 eck$LassoCheckResult]: Loop: 1297#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1292#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1293#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem54;havoc main_#t~mem53; 1297#L598-4 [2019-11-28 03:00:39,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:39,947 INFO L82 PathProgramCache]: Analyzing trace with hash 486321466, now seen corresponding path program 1 times [2019-11-28 03:00:39,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:39,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985014991] [2019-11-28 03:00:39,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:39,975 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:39,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:39,976 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 10 times [2019-11-28 03:00:39,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:39,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267297435] [2019-11-28 03:00:39,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:39,991 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:39,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:39,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1078171826, now seen corresponding path program 1 times [2019-11-28 03:00:39,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:39,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358357126] [2019-11-28 03:00:39,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:40,032 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:40,191 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-28 03:00:43,790 WARN L192 SmtUtils]: Spent 3.55 s on a formula simplification. DAG size of input: 184 DAG size of output: 163 [2019-11-28 03:00:43,981 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-28 03:00:43,985 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:00:43,985 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:00:43,985 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:00:43,985 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:00:43,986 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:00:43,986 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:43,986 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:00:43,986 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:00:43,986 INFO L133 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop-alloca.i_Iteration10_Lasso [2019-11-28 03:00:43,986 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:00:43,986 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:00:43,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:43,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,482 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-11-28 03:00:44,623 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-11-28 03:00:44,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:44,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:45,375 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:00:45,375 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:45,393 INFO L120 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 [2019-11-28 03:00:45,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:45,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:45,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:45,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:45,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:45,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:45,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:45,398 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:45,405 INFO L120 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 [2019-11-28 03:00:45,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:45,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:45,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:45,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:45,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:45,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:45,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:45,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:45,417 INFO L120 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 [2019-11-28 03:00:45,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:45,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:45,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:45,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:45,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:45,419 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:45,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:45,421 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:45,427 INFO L120 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 [2019-11-28 03:00:45,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:45,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:45,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:45,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:45,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:45,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:45,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:45,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:45,436 INFO L120 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 [2019-11-28 03:00:45,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:45,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:45,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:45,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:45,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:45,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:45,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:45,441 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:45,456 INFO L120 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 [2019-11-28 03:00:45,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:45,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:45,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:45,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:45,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:45,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:45,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:45,462 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:45,498 INFO L120 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 [2019-11-28 03:00:45,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:45,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:45,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:45,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:45,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:45,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:45,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:45,503 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:45,511 INFO L120 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 [2019-11-28 03:00:45,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:45,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:45,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:45,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:45,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:45,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:45,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:45,517 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:45,526 INFO L120 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 [2019-11-28 03:00:45,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:45,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:45,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:45,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:45,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:45,529 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:45,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:45,531 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:45,538 INFO L120 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 [2019-11-28 03:00:45,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:45,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:45,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:45,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:45,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:45,541 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:45,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:45,543 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:45,551 INFO L120 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 [2019-11-28 03:00:45,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:45,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:45,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:45,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:45,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:45,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:45,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:45,557 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:45,564 INFO L120 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 Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:45,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:45,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:45,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:45,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:45,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:45,568 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:45,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:45,569 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:45,577 INFO L120 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 [2019-11-28 03:00:45,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:45,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:45,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:45,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:45,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:45,580 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:45,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:45,582 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:45,589 INFO L120 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 [2019-11-28 03:00:45,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:45,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:45,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:45,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:45,598 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:00:45,598 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:45,604 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:45,613 INFO L120 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 [2019-11-28 03:00:45,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:45,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:45,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:45,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:45,621 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:00:45,622 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:45,631 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:45,638 INFO L120 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 [2019-11-28 03:00:45,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:45,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:45,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:45,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:45,644 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:00:45,645 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:45,655 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:00:45,670 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-28 03:00:45,671 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:45,677 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:45,680 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 03:00:45,680 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:00:45,680 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 + 100 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 - 2 >= 0] [2019-11-28 03:00:45,860 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2019-11-28 03:00:45,868 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 03:00:45,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:45,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 03:00:45,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:00:45,956 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:00:45,956 INFO L377 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 35 treesize of output 39 [2019-11-28 03:00:45,957 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:00:45,972 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:00:45,973 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:00:45,973 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:13 [2019-11-28 03:00:46,011 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-28 03:00:46,012 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:00:46,027 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:00:46,027 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:00:46,027 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2019-11-28 03:00:46,042 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-28 03:00:46,042 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:00:46,051 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:00:46,051 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:00:46,051 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2019-11-28 03:00:46,076 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-28 03:00:46,077 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:00:46,085 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:00:46,086 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:00:46,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2019-11-28 03:00:46,115 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-28 03:00:46,116 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:00:46,126 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:00:46,127 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:00:46,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2019-11-28 03:00:46,161 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-28 03:00:46,162 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:00:46,171 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:00:46,172 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:00:46,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2019-11-28 03:00:46,213 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-28 03:00:46,213 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:00:46,223 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:00:46,223 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:00:46,223 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2019-11-28 03:00:46,257 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-28 03:00:46,258 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:00:46,266 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:00:46,267 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:00:46,267 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2019-11-28 03:00:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:46,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 03:00:46,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:00:46,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:00:46,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:00:46,382 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 3 loop predicates [2019-11-28 03:00:46,382 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 10 Second operand 13 states. [2019-11-28 03:00:46,784 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 10. Second operand 13 states. Result 58 states and 70 transitions. Complement of second has 17 states. [2019-11-28 03:00:46,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2019-11-28 03:00:46,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 03:00:46,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 46 transitions. [2019-11-28 03:00:46,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 46 transitions. Stem has 19 letters. Loop has 3 letters. [2019-11-28 03:00:46,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:00:46,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 46 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-28 03:00:46,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:00:46,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 46 transitions. Stem has 19 letters. Loop has 6 letters. [2019-11-28 03:00:46,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:00:46,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 70 transitions. [2019-11-28 03:00:46,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:00:46,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 34 states and 42 transitions. [2019-11-28 03:00:46,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-11-28 03:00:46,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-11-28 03:00:46,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2019-11-28 03:00:46,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:00:46,790 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-11-28 03:00:46,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2019-11-28 03:00:46,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-11-28 03:00:46,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 03:00:46,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-11-28 03:00:46,793 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-11-28 03:00:46,793 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-11-28 03:00:46,793 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 03:00:46,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 39 transitions. [2019-11-28 03:00:46,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:00:46,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:46,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:46,794 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:00:46,794 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:00:46,794 INFO L794 eck$LassoCheckResult]: Stem: 1683#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1679#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1680#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 1682#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1664#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; 1665#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1672#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post15 := main_#t~mem14;call write~int(1 + main_#t~post15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post15;havoc main_#t~mem14; 1684#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1666#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post20;havoc main_#t~mem19; 1667#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1673#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem24;havoc main_#t~post25; 1686#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1668#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post30;havoc main_#t~mem29; 1669#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1687#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 1688#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1670#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 1671#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1678#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem44;havoc main_#t~post45; 1681#L598-4 [2019-11-28 03:00:46,794 INFO L796 eck$LassoCheckResult]: Loop: 1681#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1674#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1675#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem54;havoc main_#t~mem53; 1681#L598-4 [2019-11-28 03:00:46,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:46,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1913077182, now seen corresponding path program 1 times [2019-11-28 03:00:46,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:46,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083930473] [2019-11-28 03:00:46,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:46,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:00:46,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083930473] [2019-11-28 03:00:46,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:00:46,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 03:00:46,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409744568] [2019-11-28 03:00:46,850 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:00:46,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:46,851 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 11 times [2019-11-28 03:00:46,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:46,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652884423] [2019-11-28 03:00:46,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:46,866 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:47,002 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-28 03:00:47,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:00:47,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 03:00:47,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 03:00:47,047 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-11-28 03:00:47,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:00:47,182 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2019-11-28 03:00:47,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 03:00:47,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 38 transitions. [2019-11-28 03:00:47,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:00:47,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 38 transitions. [2019-11-28 03:00:47,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-11-28 03:00:47,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2019-11-28 03:00:47,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 38 transitions. [2019-11-28 03:00:47,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:00:47,187 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-11-28 03:00:47,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 38 transitions. [2019-11-28 03:00:47,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-11-28 03:00:47,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 03:00:47,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-11-28 03:00:47,198 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-28 03:00:47,198 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-28 03:00:47,198 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 03:00:47,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 36 transitions. [2019-11-28 03:00:47,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:00:47,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:47,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:47,200 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:00:47,203 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:00:47,203 INFO L794 eck$LassoCheckResult]: Stem: 1758#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1755#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1756#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 1757#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1739#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; 1740#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1748#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post17;havoc main_#t~mem16; 1759#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1741#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18;call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post20;havoc main_#t~mem19; 1742#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1760#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem24;havoc main_#t~post25; 1761#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1744#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post30;havoc main_#t~mem29; 1745#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1752#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 1762#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1746#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 1747#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1753#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem44;havoc main_#t~post45; 1754#L598-4 [2019-11-28 03:00:47,204 INFO L796 eck$LassoCheckResult]: Loop: 1754#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1749#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1750#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem54;havoc main_#t~mem53; 1754#L598-4 [2019-11-28 03:00:47,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:47,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1326271168, now seen corresponding path program 1 times [2019-11-28 03:00:47,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:47,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357304118] [2019-11-28 03:00:47,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:47,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:00:47,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357304118] [2019-11-28 03:00:47,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:00:47,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:00:47,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312412501] [2019-11-28 03:00:47,258 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:00:47,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:47,258 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 12 times [2019-11-28 03:00:47,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:47,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69611181] [2019-11-28 03:00:47,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:47,287 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:47,461 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-28 03:00:47,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:00:47,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:00:47,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:00:47,509 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. cyclomatic complexity: 7 Second operand 5 states. [2019-11-28 03:00:47,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:00:47,620 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2019-11-28 03:00:47,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:00:47,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2019-11-28 03:00:47,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:00:47,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 35 transitions. [2019-11-28 03:00:47,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-28 03:00:47,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-28 03:00:47,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 35 transitions. [2019-11-28 03:00:47,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:00:47,623 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-11-28 03:00:47,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 35 transitions. [2019-11-28 03:00:47,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-11-28 03:00:47,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 03:00:47,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-11-28 03:00:47,624 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-28 03:00:47,624 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-28 03:00:47,624 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-28 03:00:47,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2019-11-28 03:00:47,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:00:47,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:47,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:47,631 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:00:47,631 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:00:47,632 INFO L794 eck$LassoCheckResult]: Stem: 1829#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1826#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1827#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 1828#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1811#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; 1812#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1819#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post17;havoc main_#t~mem16; 1830#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1813#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post22;havoc main_#t~mem21; 1814#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1822#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23;call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post25 := main_#t~mem24;call write~int(1 + main_#t~post25, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem24;havoc main_#t~post25; 1831#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1815#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post30;havoc main_#t~mem29; 1816#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1823#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 1833#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1817#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 1818#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1824#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem44;havoc main_#t~post45; 1825#L598-4 [2019-11-28 03:00:47,635 INFO L796 eck$LassoCheckResult]: Loop: 1825#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1820#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1821#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem54;havoc main_#t~mem53; 1825#L598-4 [2019-11-28 03:00:47,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:47,636 INFO L82 PathProgramCache]: Analyzing trace with hash 2027335746, now seen corresponding path program 1 times [2019-11-28 03:00:47,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:47,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724280241] [2019-11-28 03:00:47,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:47,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:00:47,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724280241] [2019-11-28 03:00:47,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:00:47,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:00:47,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699087047] [2019-11-28 03:00:47,687 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:00:47,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:47,687 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 13 times [2019-11-28 03:00:47,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:47,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14731383] [2019-11-28 03:00:47,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:47,707 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:47,882 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-28 03:00:47,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:00:47,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:00:47,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:00:47,934 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 6 Second operand 5 states. [2019-11-28 03:00:48,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:00:48,032 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2019-11-28 03:00:48,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:00:48,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2019-11-28 03:00:48,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:00:48,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 32 transitions. [2019-11-28 03:00:48,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-28 03:00:48,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-28 03:00:48,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2019-11-28 03:00:48,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:00:48,034 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-11-28 03:00:48,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2019-11-28 03:00:48,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-11-28 03:00:48,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 03:00:48,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-11-28 03:00:48,036 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-11-28 03:00:48,036 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-11-28 03:00:48,036 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-28 03:00:48,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 30 transitions. [2019-11-28 03:00:48,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:00:48,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:48,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:48,041 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:00:48,041 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:00:48,045 INFO L794 eck$LassoCheckResult]: Stem: 1898#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1895#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1896#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 1897#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1879#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; 1880#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1888#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post17;havoc main_#t~mem16; 1899#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1881#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post22;havoc main_#t~mem21; 1882#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1889#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; 1900#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1883#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28;call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post30 := main_#t~mem29;call write~int(1 + main_#t~post30, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post30;havoc main_#t~mem29; 1884#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1892#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33;call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post35 := main_#t~mem34;call write~int(1 + main_#t~post35, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem34;havoc main_#t~post35; 1901#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1886#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38;call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post40 := main_#t~mem39;call write~int(1 + main_#t~post40, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem39;havoc main_#t~post40; 1887#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1893#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem44;havoc main_#t~post45; 1894#L598-4 [2019-11-28 03:00:48,045 INFO L796 eck$LassoCheckResult]: Loop: 1894#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1890#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1891#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem54;havoc main_#t~mem53; 1894#L598-4 [2019-11-28 03:00:48,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:48,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1587573180, now seen corresponding path program 1 times [2019-11-28 03:00:48,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:48,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107551447] [2019-11-28 03:00:48,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:48,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:00:48,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107551447] [2019-11-28 03:00:48,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:00:48,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 03:00:48,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363133665] [2019-11-28 03:00:48,101 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:00:48,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:48,102 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 14 times [2019-11-28 03:00:48,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:48,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633212860] [2019-11-28 03:00:48,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:48,119 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:48,262 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-28 03:00:48,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:00:48,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 03:00:48,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 03:00:48,312 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-11-28 03:00:48,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:00:48,458 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-11-28 03:00:48,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:00:48,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 32 transitions. [2019-11-28 03:00:48,460 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 03:00:48,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 27 states and 30 transitions. [2019-11-28 03:00:48,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-28 03:00:48,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-28 03:00:48,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 30 transitions. [2019-11-28 03:00:48,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:00:48,461 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-11-28 03:00:48,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 30 transitions. [2019-11-28 03:00:48,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2019-11-28 03:00:48,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 03:00:48,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-11-28 03:00:48,467 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-28 03:00:48,467 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-28 03:00:48,467 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-28 03:00:48,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2019-11-28 03:00:48,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:00:48,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:48,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:48,472 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:00:48,474 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:00:48,474 INFO L794 eck$LassoCheckResult]: Stem: 1968#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1964#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1965#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 1966#L553-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1949#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post12 := main_#t~mem11;call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post12;havoc main_#t~mem11; 1950#L558-2 call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1957#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post17 := main_#t~mem16;call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post17;havoc main_#t~mem16; 1967#L563-2 call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1951#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18;call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post22 := main_#t~mem21;call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post22;havoc main_#t~mem21; 1952#L568-2 call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1958#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23;call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post27 := main_#t~mem26;call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post27;havoc main_#t~mem26; 1969#L573-2 call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1953#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28;call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post32 := main_#t~mem31;call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem31;havoc main_#t~post32; 1954#L578-2 call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1961#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33;call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post37 := main_#t~mem36;call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem36;havoc main_#t~post37; 1970#L583-2 call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1955#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38;call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post42 := main_#t~mem41;call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post42;havoc main_#t~mem41; 1956#L588-2 call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1962#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43;call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post45 := main_#t~mem44;call write~int(1 + main_#t~post45, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem44;havoc main_#t~post45; 1963#L598-4 [2019-11-28 03:00:48,474 INFO L796 eck$LassoCheckResult]: Loop: 1963#L598-4 call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short50 := main_#t~mem48 < 100; 1959#L598 assume main_#t~short50;call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short50 := main_#t~mem49 < 100; 1960#L598-2 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~mem49;havoc main_#t~short50;call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem52;havoc main_#t~mem51;call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem54;havoc main_#t~mem53; 1963#L598-4 [2019-11-28 03:00:48,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:48,475 INFO L82 PathProgramCache]: Analyzing trace with hash 189283146, now seen corresponding path program 1 times [2019-11-28 03:00:48,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:48,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824885892] [2019-11-28 03:00:48,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:48,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:00:48,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824885892] [2019-11-28 03:00:48,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:00:48,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 03:00:48,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938333175] [2019-11-28 03:00:48,552 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:00:48,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:48,553 INFO L82 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 15 times [2019-11-28 03:00:48,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:48,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185179426] [2019-11-28 03:00:48,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:48,575 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:48,720 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-28 03:00:48,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:00:48,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 03:00:48,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 03:00:48,766 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-11-28 03:00:48,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:00:48,867 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2019-11-28 03:00:48,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:00:48,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 18 transitions. [2019-11-28 03:00:48,868 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:00:48,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2019-11-28 03:00:48,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:00:48,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:00:48,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:00:48,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:00:48,869 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:00:48,869 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:00:48,869 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:00:48,869 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-11-28 03:00:48,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:00:48,869 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:00:48,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:00:48,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:00:48 BoogieIcfgContainer [2019-11-28 03:00:48,877 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:00:48,877 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:00:48,877 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:00:48,878 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:00:48,878 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:00:25" (3/4) ... [2019-11-28 03:00:48,883 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:00:48,883 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:00:48,884 INFO L168 Benchmark]: Toolchain (without parser) took 24223.57 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 371.7 MB). Free memory was 955.0 MB in the beginning and 873.9 MB in the end (delta: 81.1 MB). Peak memory consumption was 452.8 MB. Max. memory is 11.5 GB. [2019-11-28 03:00:48,885 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:00:48,886 INFO L168 Benchmark]: CACSL2BoogieTranslator took 594.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -165.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 03:00:48,886 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-11-28 03:00:48,886 INFO L168 Benchmark]: Boogie Preprocessor took 33.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:00:48,887 INFO L168 Benchmark]: RCFGBuilder took 518.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2019-11-28 03:00:48,887 INFO L168 Benchmark]: BuchiAutomizer took 23012.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 234.4 MB). Free memory was 1.1 GB in the beginning and 873.9 MB in the end (delta: 207.1 MB). Peak memory consumption was 441.4 MB. Max. memory is 11.5 GB. [2019-11-28 03:00:48,887 INFO L168 Benchmark]: Witness Printer took 5.84 ms. Allocated memory is still 1.4 GB. Free memory is still 873.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:00:48,889 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 594.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -165.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 518.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 23012.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 234.4 MB). Free memory was 1.1 GB in the beginning and 873.9 MB in the end (delta: 207.1 MB). Peak memory consumption was 441.4 MB. Max. memory is 11.5 GB. * Witness Printer took 5.84 ms. Allocated memory is still 1.4 GB. Free memory is still 873.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 15 terminating modules (13 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z][z] + 100 and consists of 14 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y][y] + 100 and consists of 14 locations. 13 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 22.9s and 16 iterations. TraceHistogramMax:1. Analysis of lassos took 18.2s. Construction of modules took 2.1s. Büchi inclusion checks took 2.3s. Highest rank in rank-based complementation 3. Minimization of det autom 15. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 117 StatesRemovedByMinimization, 13 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 52 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 263 SDtfs, 245 SDslu, 308 SDs, 0 SdLazy, 2106 SolverSat, 141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU13 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital352 mio100 ax105 hnf100 lsp90 ukn55 mio100 lsp37 div100 bol100 ite100 ukn100 eq194 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms 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! Received shutdown request...