./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/a.01-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c 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/a.01-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 f5878942b695ddbfe46daa43f5d95028455ef120 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:33:02,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:33:02,976 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:33:02,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:33:02,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:33:02,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:33:02,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:33:02,993 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:33:02,995 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:33:02,996 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:33:02,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:33:02,999 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:33:02,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:33:03,000 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:33:03,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:33:03,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:33:03,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:33:03,007 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:33:03,010 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:33:03,012 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:33:03,017 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:33:03,021 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:33:03,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:33:03,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:33:03,030 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:33:03,032 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:33:03,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:33:03,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:33:03,035 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:33:03,036 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:33:03,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:33:03,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:33:03,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:33:03,041 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:33:03,042 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:33:03,043 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:33:03,044 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:33:03,044 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:33:03,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:33:03,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:33:03,048 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:33:03,050 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 20:33:03,070 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:33:03,070 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:33:03,072 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:33:03,072 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:33:03,072 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:33:03,073 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:33:03,073 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:33:03,073 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:33:03,073 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:33:03,074 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:33:03,074 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:33:03,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:33:03,074 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:33:03,075 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:33:03,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:33:03,075 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:33:03,076 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:33:03,076 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:33:03,076 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:33:03,076 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:33:03,077 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:33:03,077 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:33:03,077 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:33:03,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:33:03,078 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:33:03,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:33:03,078 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:33:03,079 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:33:03,079 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:33:03,080 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:33:03,080 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 -> f5878942b695ddbfe46daa43f5d95028455ef120 [2019-11-28 20:33:03,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:33:03,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:33:03,413 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:33:03,415 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:33:03,415 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:33:03,416 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/a.01-alloca.i [2019-11-28 20:33:03,484 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6c61a6a5/4a6ee550e6814fdda08b665c9095f339/FLAGf243a7d47 [2019-11-28 20:33:03,993 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:33:03,994 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/a.01-alloca.i [2019-11-28 20:33:04,015 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6c61a6a5/4a6ee550e6814fdda08b665c9095f339/FLAGf243a7d47 [2019-11-28 20:33:04,294 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6c61a6a5/4a6ee550e6814fdda08b665c9095f339 [2019-11-28 20:33:04,299 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:33:04,302 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:33:04,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:33:04,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:33:04,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:33:04,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:33:04" (1/1) ... [2019-11-28 20:33:04,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@388be10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:04, skipping insertion in model container [2019-11-28 20:33:04,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:33:04" (1/1) ... [2019-11-28 20:33:04,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:33:04,383 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:33:04,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:33:04,795 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:33:04,837 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:33:04,894 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:33:04,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:04 WrapperNode [2019-11-28 20:33:04,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:33:04,896 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:33:04,897 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:33:04,897 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:33:04,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:04" (1/1) ... [2019-11-28 20:33:04,925 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:04" (1/1) ... [2019-11-28 20:33:04,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:33:04,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:33:04,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:33:04,953 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:33:04,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:04" (1/1) ... [2019-11-28 20:33:04,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:04" (1/1) ... [2019-11-28 20:33:04,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:04" (1/1) ... [2019-11-28 20:33:04,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:04" (1/1) ... [2019-11-28 20:33:04,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:04" (1/1) ... [2019-11-28 20:33:04,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:04" (1/1) ... [2019-11-28 20:33:04,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:04" (1/1) ... [2019-11-28 20:33:04,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:33:04,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:33:04,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:33:04,982 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:33:04,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:04" (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 20:33:05,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:33:05,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:33:05,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:33:05,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:33:05,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:33:05,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:33:05,331 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:33:05,331 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 20:33:05,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:33:05 BoogieIcfgContainer [2019-11-28 20:33:05,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:33:05,334 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:33:05,334 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:33:05,338 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:33:05,339 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:33:05,339 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:33:04" (1/3) ... [2019-11-28 20:33:05,340 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75746c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:33:05, skipping insertion in model container [2019-11-28 20:33:05,341 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:33:05,341 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:04" (2/3) ... [2019-11-28 20:33:05,342 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75746c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:33:05, skipping insertion in model container [2019-11-28 20:33:05,342 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:33:05,344 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:33:05" (3/3) ... [2019-11-28 20:33:05,346 INFO L371 chiAutomizerObserver]: Analyzing ICFG a.01-alloca.i [2019-11-28 20:33:05,403 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:33:05,403 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:33:05,403 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:33:05,404 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:33:05,404 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:33:05,404 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:33:05,404 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:33:05,404 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:33:05,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-28 20:33:05,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 20:33:05,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:33:05,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:33:05,442 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:33:05,442 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:33:05,442 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:33:05,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-28 20:33:05,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 20:33:05,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:33:05,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:33:05,445 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:33:05,445 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:33:05,451 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 6#L555-3true [2019-11-28 20:33:05,452 INFO L796 eck$LassoCheckResult]: Loop: 6#L555-3true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 13#L555-1true assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 14#L557-3true assume !true; 4#L557-4true call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 6#L555-3true [2019-11-28 20:33:05,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:05,457 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-28 20:33:05,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:05,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247249785] [2019-11-28 20:33:05,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:05,631 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:05,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:05,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2019-11-28 20:33:05,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:05,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132142363] [2019-11-28 20:33:05,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:05,693 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 20:33:05,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132142363] [2019-11-28 20:33:05,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:33:05,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:33:05,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329601782] [2019-11-28 20:33:05,701 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:33:05,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:33:05,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 20:33:05,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 20:33:05,720 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2019-11-28 20:33:05,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:33:05,726 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-11-28 20:33:05,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 20:33:05,728 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2019-11-28 20:33:05,730 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 20:33:05,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 8 transitions. [2019-11-28 20:33:05,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 20:33:05,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 20:33:05,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-11-28 20:33:05,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:33:05,738 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-28 20:33:05,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-11-28 20:33:05,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-11-28 20:33:05,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 20:33:05,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-11-28 20:33:05,769 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-28 20:33:05,769 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-28 20:33:05,770 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:33:05,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2019-11-28 20:33:05,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 20:33:05,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:33:05,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:33:05,772 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:33:05,772 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 20:33:05,772 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 32#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 33#L555-3 [2019-11-28 20:33:05,773 INFO L796 eck$LassoCheckResult]: Loop: 33#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 36#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 38#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 37#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 34#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 33#L555-3 [2019-11-28 20:33:05,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:05,773 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-28 20:33:05,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:05,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556502855] [2019-11-28 20:33:05,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:05,826 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:05,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:05,828 INFO L82 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2019-11-28 20:33:05,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:05,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107628738] [2019-11-28 20:33:05,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:05,894 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:05,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:05,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907759, now seen corresponding path program 1 times [2019-11-28 20:33:05,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:05,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685443404] [2019-11-28 20:33:05,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:06,057 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 20:33:06,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685443404] [2019-11-28 20:33:06,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:33:06,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:33:06,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823780168] [2019-11-28 20:33:06,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:33:06,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:33:06,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:33:06,195 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 6 states. [2019-11-28 20:33:06,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:33:06,304 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-11-28 20:33:06,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:33:06,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-11-28 20:33:06,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:33:06,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2019-11-28 20:33:06,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-28 20:33:06,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-28 20:33:06,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2019-11-28 20:33:06,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:33:06,311 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-28 20:33:06,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2019-11-28 20:33:06,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-11-28 20:33:06,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 20:33:06,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-11-28 20:33:06,316 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-28 20:33:06,316 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-28 20:33:06,316 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:33:06,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2019-11-28 20:33:06,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:33:06,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:33:06,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:33:06,319 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:33:06,319 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2019-11-28 20:33:06,319 INFO L794 eck$LassoCheckResult]: Stem: 66#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 63#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 64#L555-3 [2019-11-28 20:33:06,320 INFO L796 eck$LassoCheckResult]: Loop: 64#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 67#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 70#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 68#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 69#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 71#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 65#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 64#L555-3 [2019-11-28 20:33:06,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:06,321 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-11-28 20:33:06,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:06,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499878125] [2019-11-28 20:33:06,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:06,388 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:06,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:06,389 INFO L82 PathProgramCache]: Analyzing trace with hash -274676436, now seen corresponding path program 1 times [2019-11-28 20:33:06,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:06,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057898551] [2019-11-28 20:33:06,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:06,423 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:06,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:06,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1271620394, now seen corresponding path program 1 times [2019-11-28 20:33:06,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:06,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872398033] [2019-11-28 20:33:06,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:06,513 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:06,683 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-11-28 20:33:07,095 WARN L192 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 80 [2019-11-28 20:33:07,247 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-28 20:33:07,263 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:33:07,264 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:33:07,264 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:33:07,264 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:33:07,265 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:33:07,265 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:07,265 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:33:07,265 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:33:07,266 INFO L133 ssoRankerPreferences]: Filename of dumped script: a.01-alloca.i_Iteration3_Lasso [2019-11-28 20:33:07,266 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:33:07,266 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:33:07,300 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 20:33:07,308 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 20:33:07,679 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-11-28 20:33:07,800 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 20:33:07,802 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 20:33:07,804 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 20:33:07,807 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 20:33:07,813 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 20:33:07,817 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 20:33:07,819 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 20:33:07,822 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 20:33:07,824 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 20:33:07,827 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 20:33:07,829 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 20:33:07,831 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 20:33:07,842 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 20:33:08,353 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:33:08,358 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 20:33:08,369 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 20:33:08,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:08,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:08,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:08,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:08,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:08,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:08,377 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:08,380 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) [2019-11-28 20:33:08,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 20:33:08,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:08,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:08,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:08,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:08,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:08,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:08,403 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) [2019-11-28 20:33:08,415 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 20:33:08,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:08,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:08,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:08,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:08,422 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:08,422 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:08,426 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe 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) [2019-11-28 20:33:08,438 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 20:33:08,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:08,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:08,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:08,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:08,444 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:08,444 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:08,448 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) [2019-11-28 20:33:08,457 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 20:33:08,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:08,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:08,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:08,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:08,463 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:08,463 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:33:08,475 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) [2019-11-28 20:33:08,490 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 20:33:08,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:08,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:08,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:08,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:08,504 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:08,505 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:08,524 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) [2019-11-28 20:33:08,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 20:33:08,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:08,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:08,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:08,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:08,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:08,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:33:08,576 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:08,641 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-28 20:33:08,641 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. 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) [2019-11-28 20:33:08,699 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:08,715 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:33:08,716 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:33:08,716 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2019-11-28 20:33:08,812 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2019-11-28 20:33:08,819 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 20:33:08,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:08,857 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:33:08,858 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:33:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:08,878 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:33:08,879 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:33:08,971 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:33:08,972 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 45 [2019-11-28 20:33:08,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:33:08,980 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:33:09,023 INFO L614 ElimStorePlain]: treesize reduction 16, result has 68.0 percent of original size [2019-11-28 20:33:09,024 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:33:09,025 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:34 [2019-11-28 20:33:09,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:33:09,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:33:09,102 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:33:09,103 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 64 [2019-11-28 20:33:09,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:33:09,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:33:09,108 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:33:09,116 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-28 20:33:09,117 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:33:09,168 INFO L614 ElimStorePlain]: treesize reduction 103, result has 17.6 percent of original size [2019-11-28 20:33:09,168 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:33:09,168 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:74, output treesize:22 [2019-11-28 20:33:09,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:33:09,274 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-28 20:33:09,275 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 7 states. [2019-11-28 20:33:09,470 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2. Second operand 7 states. Result 23 states and 26 transitions. Complement of second has 13 states. [2019-11-28 20:33:09,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-28 20:33:09,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 20:33:09,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-11-28 20:33:09,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 7 letters. [2019-11-28 20:33:09,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:33:09,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 9 letters. Loop has 7 letters. [2019-11-28 20:33:09,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:33:09,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 14 letters. [2019-11-28 20:33:09,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:33:09,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2019-11-28 20:33:09,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:33:09,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 22 states and 25 transitions. [2019-11-28 20:33:09,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 20:33:09,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 20:33:09,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2019-11-28 20:33:09,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:33:09,479 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-28 20:33:09,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2019-11-28 20:33:09,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-11-28 20:33:09,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 20:33:09,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-11-28 20:33:09,482 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-28 20:33:09,483 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-28 20:33:09,483 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:33:09,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2019-11-28 20:33:09,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:33:09,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:33:09,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:33:09,485 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:33:09,485 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2019-11-28 20:33:09,485 INFO L794 eck$LassoCheckResult]: Stem: 247#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 241#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 242#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 250#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 260#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 251#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 252#L557-3 [2019-11-28 20:33:09,485 INFO L796 eck$LassoCheckResult]: Loop: 252#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 255#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 258#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 257#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 243#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 244#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 248#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 252#L557-3 [2019-11-28 20:33:09,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:09,486 INFO L82 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2019-11-28 20:33:09,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:09,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332487527] [2019-11-28 20:33:09,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:09,521 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:09,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:09,521 INFO L82 PathProgramCache]: Analyzing trace with hash 296665942, now seen corresponding path program 2 times [2019-11-28 20:33:09,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:09,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721125180] [2019-11-28 20:33:09,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:09,570 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:09,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:09,570 INFO L82 PathProgramCache]: Analyzing trace with hash -425323062, now seen corresponding path program 2 times [2019-11-28 20:33:09,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:09,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225498110] [2019-11-28 20:33:09,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:09,637 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:10,357 WARN L192 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 106 [2019-11-28 20:33:10,534 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-28 20:33:10,537 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:33:10,537 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:33:10,538 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:33:10,538 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:33:10,538 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:33:10,538 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:10,538 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:33:10,538 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:33:10,538 INFO L133 ssoRankerPreferences]: Filename of dumped script: a.01-alloca.i_Iteration4_Lasso [2019-11-28 20:33:10,539 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:33:10,540 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:33:10,546 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 20:33:10,555 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 20:33:10,558 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 20:33:10,561 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 20:33:10,563 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 20:33:10,565 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 20:33:10,568 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 20:33:10,570 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 20:33:10,573 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 20:33:10,575 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 20:33:10,577 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 20:33:10,580 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 20:33:10,581 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 20:33:10,910 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-11-28 20:33:11,040 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-28 20:33:11,041 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 20:33:11,044 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 20:33:11,047 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 20:33:11,197 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 20:33:11,629 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:33:11,630 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:11,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 20:33:11,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:11,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:11,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:11,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:11,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:11,640 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:11,640 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:33:11,642 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) [2019-11-28 20:33:11,649 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 20:33:11,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:11,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:11,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:11,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:11,654 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:11,654 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:33:11,656 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 20:33:11,663 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 20:33:11,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:11,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:11,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:11,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:11,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:11,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:11,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:33:11,667 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 20:33:11,674 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 20:33:11,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:11,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:11,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:11,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:11,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:11,676 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:11,676 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:33:11,677 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 20:33:11,682 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 20:33:11,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:11,684 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:11,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:11,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:11,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:11,685 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:11,685 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:33:11,688 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 20:33:11,695 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 20:33:11,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:11,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:11,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:11,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:11,698 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:11,698 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:33:11,702 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 20:33:11,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 20:33:11,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:11,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:11,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:11,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:11,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:11,726 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:11,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:33:11,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 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 20:33:11,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 20:33:11,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:11,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:11,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:11,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:11,739 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:11,739 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:33:11,742 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) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:11,755 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 20:33:11,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:11,757 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:11,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:11,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:11,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:11,758 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:11,758 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:33:11,759 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) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:11,766 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 20:33:11,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:11,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:11,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:11,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:11,769 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:11,769 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:33:11,777 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:33:11,802 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 20:33:11,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:11,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:11,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:11,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:11,808 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:11,808 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:33:11,819 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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 20:33:11,836 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 20:33:11,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:11,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:11,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:11,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:11,842 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:11,842 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:33:11,846 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) [2019-11-28 20:33:11,853 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 20:33:11,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:11,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:11,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:11,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:11,865 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:11,865 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:11,883 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) [2019-11-28 20:33:11,892 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 20:33:11,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:11,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:11,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:11,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:11,897 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:11,897 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:11,902 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) [2019-11-28 20:33:11,911 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 20:33:11,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:11,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:11,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:11,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:11,916 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:11,916 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:11,923 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) [2019-11-28 20:33:11,930 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 20:33:11,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:11,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:11,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:11,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:11,942 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:11,942 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:11,953 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:33:11,964 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-28 20:33:11,964 INFO L444 ModelExtractionUtils]: 11 out of 19 variables were initially zero. Simplification set additionally 6 variables to zero. 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) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:11,969 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:33:11,971 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:33:11,971 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:33:11,971 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2019-11-28 20:33:12,066 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2019-11-28 20:33:12,068 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 20:33:12,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:12,100 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:33:12,101 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:33:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:12,131 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 20:33:12,132 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:33:12,170 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:33:12,171 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 63 [2019-11-28 20:33:12,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:33:12,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:33:12,174 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:33:12,205 INFO L614 ElimStorePlain]: treesize reduction 67, result has 29.5 percent of original size [2019-11-28 20:33:12,205 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:33:12,205 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:28 [2019-11-28 20:33:12,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:33:12,299 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 26 [2019-11-28 20:33:12,300 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:33:12,309 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:33:12,310 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 26 [2019-11-28 20:33:12,311 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:33:12,334 INFO L614 ElimStorePlain]: treesize reduction 45, result has 44.4 percent of original size [2019-11-28 20:33:12,334 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:33:12,334 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:103, output treesize:36 [2019-11-28 20:33:12,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:33:12,386 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-28 20:33:12,387 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 8 states. [2019-11-28 20:33:12,527 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5. Second operand 8 states. Result 51 states and 58 transitions. Complement of second has 17 states. [2019-11-28 20:33:12,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2019-11-28 20:33:12,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 20:33:12,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 17 transitions. [2019-11-28 20:33:12,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 17 transitions. Stem has 6 letters. Loop has 7 letters. [2019-11-28 20:33:12,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:33:12,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 17 transitions. Stem has 13 letters. Loop has 7 letters. [2019-11-28 20:33:12,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:33:12,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 17 transitions. Stem has 6 letters. Loop has 14 letters. [2019-11-28 20:33:12,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:33:12,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 58 transitions. [2019-11-28 20:33:12,534 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-28 20:33:12,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 43 states and 50 transitions. [2019-11-28 20:33:12,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-28 20:33:12,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-28 20:33:12,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 50 transitions. [2019-11-28 20:33:12,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:33:12,536 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2019-11-28 20:33:12,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 50 transitions. [2019-11-28 20:33:12,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2019-11-28 20:33:12,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 20:33:12,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2019-11-28 20:33:12,540 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-11-28 20:33:12,540 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-11-28 20:33:12,540 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:33:12,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 39 transitions. [2019-11-28 20:33:12,541 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-28 20:33:12,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:33:12,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:33:12,542 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2019-11-28 20:33:12,542 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:33:12,542 INFO L794 eck$LassoCheckResult]: Stem: 494#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 488#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 489#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 496#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 502#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 520#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 518#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 498#L557-1 [2019-11-28 20:33:12,542 INFO L796 eck$LassoCheckResult]: Loop: 498#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 499#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 498#L557-1 [2019-11-28 20:33:12,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:12,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907812, now seen corresponding path program 2 times [2019-11-28 20:33:12,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:12,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665977090] [2019-11-28 20:33:12,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:12,568 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:12,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:12,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1660, now seen corresponding path program 1 times [2019-11-28 20:33:12,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:12,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979483067] [2019-11-28 20:33:12,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:12,577 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:12,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:12,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1271620447, now seen corresponding path program 3 times [2019-11-28 20:33:12,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:12,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781430022] [2019-11-28 20:33:12,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:12,634 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:13,209 WARN L192 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 114 [2019-11-28 20:33:13,373 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-28 20:33:13,377 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:33:13,377 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:33:13,377 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:33:13,377 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:33:13,377 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:33:13,378 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:13,378 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:33:13,378 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:33:13,378 INFO L133 ssoRankerPreferences]: Filename of dumped script: a.01-alloca.i_Iteration5_Lasso [2019-11-28 20:33:13,378 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:33:13,378 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:33:13,382 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 20:33:13,392 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 20:33:13,394 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 20:33:13,396 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 20:33:13,398 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 20:33:13,400 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 20:33:13,405 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 20:33:13,406 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 20:33:13,408 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 20:33:13,409 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 20:33:13,412 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 20:33:13,414 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 20:33:13,416 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 20:33:13,784 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-11-28 20:33:13,919 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-11-28 20:33:13,920 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 20:33:14,481 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:33:14,481 INFO L489 LassoAnalysis]: Using template 'affine'. 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 20:33:14,492 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 20:33:14,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:14,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:14,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:14,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:14,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:14,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:14,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:33:14,496 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) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:14,502 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 20:33:14,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:14,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:14,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:14,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:14,504 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:14,504 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:33:14,507 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) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:14,513 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 20:33:14,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:14,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:14,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:14,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:14,523 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:14,523 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:33:14,526 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) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:14,532 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 20:33:14,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:14,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:14,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:14,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:14,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:14,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:14,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:33:14,544 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) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:14,549 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 20:33:14,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:14,550 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:14,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:14,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:14,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:14,551 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:14,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:33:14,554 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) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:14,567 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 20:33:14,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:14,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:14,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:14,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:14,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:14,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:33:14,576 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 20:33:14,586 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 20:33:14,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:14,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:14,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:14,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:14,590 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:14,590 INFO L402 nArgumentSynthesizer]: A total of 2 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 20:33:14,594 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 20:33:14,603 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 20:33:14,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:14,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:14,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:14,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:14,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:14,606 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:14,606 INFO L402 nArgumentSynthesizer]: A total of 0 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 20:33:14,608 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 20:33:14,616 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 20:33:14,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:14,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:14,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:14,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:14,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:14,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:14,619 INFO L402 nArgumentSynthesizer]: A total of 0 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 20:33:14,621 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) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:14,630 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 20:33:14,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:14,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:14,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:14,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:14,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:14,636 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:33:14,640 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:33:14,658 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 20:33:14,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:14,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:14,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:14,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:14,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:14,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:14,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:14,663 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:33:14,673 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 20:33:14,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:14,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:14,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:14,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:14,677 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:14,677 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:14,683 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:33:14,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 [2019-11-28 20:33:14,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:14,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:14,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:14,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:14,699 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:14,699 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:14,715 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:33:14,743 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-28 20:33:14,743 INFO L444 ModelExtractionUtils]: 9 out of 25 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:33:14,749 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:14,752 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 20:33:14,752 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:33:14,752 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3 + 1*ULTIMATE.start_test_fun_#t~mem6 - 1*ULTIMATE.start_test_fun_#t~mem7 >= 0] [2019-11-28 20:33:14,850 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-11-28 20:33:14,857 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 20:33:14,858 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 20:33:14,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:14,902 INFO L264 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:33:14,902 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:33:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:14,908 INFO L264 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:33:14,908 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:33:14,943 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:33:14,944 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 65 [2019-11-28 20:33:14,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:33:14,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:33:14,948 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:33:14,976 INFO L614 ElimStorePlain]: treesize reduction 59, result has 37.9 percent of original size [2019-11-28 20:33:14,977 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:33:14,977 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:36 [2019-11-28 20:33:14,996 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 20:33:14,996 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:33:14,996 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-28 20:33:15,048 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 47 states and 55 transitions. Complement of second has 6 states. [2019-11-28 20:33:15,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states [2019-11-28 20:33:15,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:33:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-11-28 20:33:15,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-28 20:33:15,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:33:15,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-28 20:33:15,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:33:15,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-28 20:33:15,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:33:15,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 55 transitions. [2019-11-28 20:33:15,053 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-28 20:33:15,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 42 states and 48 transitions. [2019-11-28 20:33:15,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-28 20:33:15,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-28 20:33:15,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 48 transitions. [2019-11-28 20:33:15,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:33:15,055 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-11-28 20:33:15,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 48 transitions. [2019-11-28 20:33:15,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2019-11-28 20:33:15,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 20:33:15,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2019-11-28 20:33:15,058 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-11-28 20:33:15,058 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-11-28 20:33:15,058 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:33:15,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2019-11-28 20:33:15,060 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-28 20:33:15,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:33:15,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:33:15,061 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1] [2019-11-28 20:33:15,061 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2019-11-28 20:33:15,061 INFO L794 eck$LassoCheckResult]: Stem: 728#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 722#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 723#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 730#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 737#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 734#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 735#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 749#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 748#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 747#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 746#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 745#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 743#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 742#L557-3 [2019-11-28 20:33:15,061 INFO L796 eck$LassoCheckResult]: Loop: 742#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 741#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 740#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 739#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 724#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 725#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 744#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 742#L557-3 [2019-11-28 20:33:15,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:15,062 INFO L82 PathProgramCache]: Analyzing trace with hash -474670092, now seen corresponding path program 3 times [2019-11-28 20:33:15,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:15,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400181999] [2019-11-28 20:33:15,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:15,145 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:33:15,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400181999] [2019-11-28 20:33:15,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629458252] [2019-11-28 20:33:15,146 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:33:15,207 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 20:33:15,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:33:15,208 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:33:15,210 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:33:15,216 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 20:33:15,216 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:33:15,218 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:33:15,218 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:33:15,219 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-28 20:33:15,223 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-28 20:33:15,223 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:33:15,225 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:33:15,225 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:33:15,225 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-28 20:33:15,311 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:33:15,312 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 61 [2019-11-28 20:33:15,313 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:33:15,350 INFO L614 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size [2019-11-28 20:33:15,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:33:15,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:33:15,353 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:33:15,353 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:41 [2019-11-28 20:33:15,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:33:15,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:33:15,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:33:15,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:33:15,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:33:15,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:33:15,410 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:33:15,410 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2019-11-28 20:33:15,411 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:33:15,419 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:33:15,420 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-28 20:33:15,420 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:33:15,426 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-28 20:33:15,426 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 20:33:15,430 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-28 20:33:15,431 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-28 20:33:15,439 INFO L614 ElimStorePlain]: treesize reduction 30, result has 9.1 percent of original size [2019-11-28 20:33:15,440 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:33:15,440 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:104, output treesize:3 [2019-11-28 20:33:15,442 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:33:15,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:33:15,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2019-11-28 20:33:15,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170104660] [2019-11-28 20:33:15,443 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:33:15,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:15,444 INFO L82 PathProgramCache]: Analyzing trace with hash 296665942, now seen corresponding path program 3 times [2019-11-28 20:33:15,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:15,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517660854] [2019-11-28 20:33:15,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:15,459 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:15,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:33:15,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 20:33:15,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:33:15,573 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 11 Second operand 13 states. [2019-11-28 20:33:15,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:33:15,815 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-11-28 20:33:15,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:33:15,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 40 transitions. [2019-11-28 20:33:15,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:33:15,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 25 states and 28 transitions. [2019-11-28 20:33:15,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 20:33:15,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 20:33:15,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2019-11-28 20:33:15,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:33:15,821 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-11-28 20:33:15,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2019-11-28 20:33:15,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2019-11-28 20:33:15,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 20:33:15,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-11-28 20:33:15,824 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-11-28 20:33:15,824 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-11-28 20:33:15,824 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 20:33:15,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2019-11-28 20:33:15,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:33:15,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:33:15,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:33:15,826 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 1, 1, 1, 1] [2019-11-28 20:33:15,826 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:33:15,826 INFO L794 eck$LassoCheckResult]: Stem: 861#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 857#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 858#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 862#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 868#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 864#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 865#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 872#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 874#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 873#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 859#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 860#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 863#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 869#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 871#L557-1 [2019-11-28 20:33:15,826 INFO L796 eck$LassoCheckResult]: Loop: 871#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 870#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 871#L557-1 [2019-11-28 20:33:15,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:15,826 INFO L82 PathProgramCache]: Analyzing trace with hash -300113017, now seen corresponding path program 4 times [2019-11-28 20:33:15,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:15,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829572011] [2019-11-28 20:33:15,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:15,893 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:15,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:15,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1660, now seen corresponding path program 2 times [2019-11-28 20:33:15,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:15,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894279349] [2019-11-28 20:33:15,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:15,914 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:15,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:15,916 INFO L82 PathProgramCache]: Analyzing trace with hash -645799806, now seen corresponding path program 5 times [2019-11-28 20:33:15,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:15,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366180622] [2019-11-28 20:33:15,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:15,986 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:17,700 WARN L192 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 173 DAG size of output: 149 [2019-11-28 20:33:18,005 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-11-28 20:33:18,008 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:33:18,009 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:33:18,009 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:33:18,009 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:33:18,009 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:33:18,009 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:18,009 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:33:18,009 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:33:18,009 INFO L133 ssoRankerPreferences]: Filename of dumped script: a.01-alloca.i_Iteration7_Lasso [2019-11-28 20:33:18,010 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:33:18,010 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:33:18,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 20:33:18,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 20:33:18,019 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 20:33:18,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 20:33:18,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 20:33:18,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 20:33:18,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 20:33:18,417 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2019-11-28 20:33:18,556 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-11-28 20:33:18,557 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 20:33:18,558 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 20:33:18,560 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 20:33:18,562 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 20:33:18,563 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 20:33:18,565 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 20:33:18,567 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 20:33:19,160 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:33:19,160 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:33:19,182 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:19,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:19,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:19,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:19,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:19,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:19,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:19,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:33:19,186 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 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:19,193 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 20:33:19,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:19,195 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:19,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:19,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:19,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:19,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:19,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:33:19,197 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 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:19,202 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 20:33:19,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:19,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:19,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:19,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:19,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:19,206 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:33:19,217 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:33:19,224 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 20:33:19,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:19,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:19,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:19,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:19,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:19,227 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:19,227 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:19,230 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:33:19,236 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 20:33:19,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:19,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:19,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:19,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:19,240 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:19,240 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:19,244 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:33:19,251 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 20:33:19,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:19,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:19,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:19,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:19,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:19,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:19,259 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:33:19,265 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 20:33:19,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:19,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:19,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:19,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:19,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:19,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:19,273 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:33:19,280 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 20:33:19,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:19,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:19,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:19,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:19,289 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:19,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:19,304 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:33:19,327 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-11-28 20:33:19,327 INFO L444 ModelExtractionUtils]: 9 out of 25 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:33:19,332 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:19,335 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 20:33:19,335 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:33:19,335 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_4) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_4 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_4 + 1*ULTIMATE.start_test_fun_#t~mem6 - 1*ULTIMATE.start_test_fun_#t~mem7 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 >= 0] [2019-11-28 20:33:19,426 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-11-28 20:33:19,429 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 20:33:19,430 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 20:33:19,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:19,479 INFO L264 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:33:19,480 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:33:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:19,492 INFO L264 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:33:19,492 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:33:19,520 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:33:19,521 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 65 [2019-11-28 20:33:19,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:33:19,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:33:19,525 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:33:19,597 INFO L614 ElimStorePlain]: treesize reduction 59, result has 37.9 percent of original size [2019-11-28 20:33:19,597 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:33:19,597 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:36 [2019-11-28 20:33:19,618 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 20:33:19,618 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:33:19,618 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-28 20:33:19,659 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 23 states and 27 transitions. Complement of second has 6 states. [2019-11-28 20:33:19,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states [2019-11-28 20:33:19,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:33:19,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-11-28 20:33:19,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 14 letters. Loop has 2 letters. [2019-11-28 20:33:19,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:33:19,661 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:33:19,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:19,712 INFO L264 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:33:19,713 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:33:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:19,721 INFO L264 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:33:19,722 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:33:19,755 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:33:19,755 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 65 [2019-11-28 20:33:19,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:33:19,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:33:19,759 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:33:19,796 INFO L614 ElimStorePlain]: treesize reduction 59, result has 37.9 percent of original size [2019-11-28 20:33:19,796 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:33:19,797 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:36 [2019-11-28 20:33:19,815 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 20:33:19,816 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:33:19,816 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-28 20:33:19,850 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 24 states and 27 transitions. Complement of second has 5 states. [2019-11-28 20:33:19,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:33:19,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:33:19,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-28 20:33:19,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 14 letters. Loop has 2 letters. [2019-11-28 20:33:19,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:33:19,853 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:33:19,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:19,914 INFO L264 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:33:19,915 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:33:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:19,923 INFO L264 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:33:19,923 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:33:19,947 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:33:19,948 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 65 [2019-11-28 20:33:19,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:33:19,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:33:19,952 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:33:19,984 INFO L614 ElimStorePlain]: treesize reduction 59, result has 37.9 percent of original size [2019-11-28 20:33:19,985 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:33:19,985 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:36 [2019-11-28 20:33:20,005 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 20:33:20,005 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:33:20,006 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-28 20:33:20,061 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 27 states and 31 transitions. Complement of second has 5 states. [2019-11-28 20:33:20,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states [2019-11-28 20:33:20,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:33:20,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-28 20:33:20,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 2 letters. [2019-11-28 20:33:20,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:33:20,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 16 letters. Loop has 2 letters. [2019-11-28 20:33:20,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:33:20,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 4 letters. [2019-11-28 20:33:20,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:33:20,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2019-11-28 20:33:20,065 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:33:20,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2019-11-28 20:33:20,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 20:33:20,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 20:33:20,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 20:33:20,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:33:20,066 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:33:20,066 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:33:20,066 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:33:20,066 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 20:33:20,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:33:20,066 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:33:20,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 20:33:20,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:33:20 BoogieIcfgContainer [2019-11-28 20:33:20,072 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:33:20,073 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:33:20,073 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:33:20,073 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:33:20,074 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:33:05" (3/4) ... [2019-11-28 20:33:20,077 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:33:20,077 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:33:20,078 INFO L168 Benchmark]: Toolchain (without parser) took 15777.43 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 371.7 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -128.3 MB). Peak memory consumption was 243.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:33:20,079 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:33:20,079 INFO L168 Benchmark]: CACSL2BoogieTranslator took 591.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -154.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:33:20,080 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.76 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:33:20,080 INFO L168 Benchmark]: Boogie Preprocessor took 28.97 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:33:20,080 INFO L168 Benchmark]: RCFGBuilder took 351.47 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: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:33:20,081 INFO L168 Benchmark]: BuchiAutomizer took 14738.74 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -5.7 MB). Peak memory consumption was 233.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:33:20,081 INFO L168 Benchmark]: Witness Printer took 4.08 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:33:20,084 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 591.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -154.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.76 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.97 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 351.47 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: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14738.74 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -5.7 MB). Peak memory consumption was 233.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.08 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 9 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 4 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.6s and 8 iterations. TraceHistogramMax:4. Analysis of lassos took 12.1s. Construction of modules took 0.3s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 22 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 36 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/4 HoareTripleCheckerStatistics: 51 SDtfs, 47 SDslu, 17 SDs, 0 SdLazy, 218 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital607 mio100 ax103 hnf100 lsp94 ukn38 mio100 lsp37 div100 bol100 ite100 ukn100 eq181 hnf88 smp94 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms 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...