./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.15-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9761715c-b810-4e59-b302-138966d92f13/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9761715c-b810-4e59-b302-138966d92f13/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9761715c-b810-4e59-b302-138966d92f13/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9761715c-b810-4e59-b302-138966d92f13/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.15-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9761715c-b810-4e59-b302-138966d92f13/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9761715c-b810-4e59-b302-138966d92f13/bin/uautomizer --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 7464e7c5283b85fe14cc907bcd5d5339a700ef74 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:22:39,897 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:22:39,898 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:22:39,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:22:39,912 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:22:39,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:22:39,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:22:39,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:22:39,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:22:39,931 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:22:39,932 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:22:39,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:22:39,934 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:22:39,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:22:39,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:22:39,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:22:39,938 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:22:39,939 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:22:39,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:22:39,944 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:22:39,947 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:22:39,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:22:39,951 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:22:39,952 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:22:39,955 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:22:39,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:22:39,955 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:22:39,957 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:22:39,957 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:22:39,958 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:22:39,958 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:22:39,958 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:22:39,959 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:22:39,959 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:22:39,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:22:39,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:22:39,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:22:39,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:22:39,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:22:39,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:22:39,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:22:39,964 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9761715c-b810-4e59-b302-138966d92f13/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:22:39,989 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:22:39,990 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:22:39,991 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:22:39,991 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:22:39,991 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:22:39,991 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:22:39,991 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:22:39,992 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:22:39,992 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:22:39,992 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:22:39,992 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:22:39,993 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:22:39,993 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:22:39,993 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:22:39,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:22:39,993 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:22:39,994 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:22:39,994 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:22:39,994 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:22:39,994 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:22:39,994 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:22:39,994 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:22:39,995 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:22:39,995 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:22:39,995 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:22:39,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:22:39,996 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:22:39,996 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:22:39,997 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:22:39,997 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_9761715c-b810-4e59-b302-138966d92f13/bin/uautomizer 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 -> 7464e7c5283b85fe14cc907bcd5d5339a700ef74 [2019-11-16 00:22:40,020 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:22:40,030 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:22:40,033 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:22:40,034 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:22:40,034 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:22:40,035 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9761715c-b810-4e59-b302-138966d92f13/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.15-alloca.i [2019-11-16 00:22:40,082 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9761715c-b810-4e59-b302-138966d92f13/bin/uautomizer/data/7436dfd27/9269e40febca4ed6b9fb2a4faeaac15f/FLAG542d1e519 [2019-11-16 00:22:40,532 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:22:40,533 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9761715c-b810-4e59-b302-138966d92f13/sv-benchmarks/c/termination-memory-alloca/b.15-alloca.i [2019-11-16 00:22:40,546 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9761715c-b810-4e59-b302-138966d92f13/bin/uautomizer/data/7436dfd27/9269e40febca4ed6b9fb2a4faeaac15f/FLAG542d1e519 [2019-11-16 00:22:41,053 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9761715c-b810-4e59-b302-138966d92f13/bin/uautomizer/data/7436dfd27/9269e40febca4ed6b9fb2a4faeaac15f [2019-11-16 00:22:41,055 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:22:41,056 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:22:41,057 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:22:41,057 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:22:41,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:22:41,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:22:41" (1/1) ... [2019-11-16 00:22:41,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@562ca7f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:41, skipping insertion in model container [2019-11-16 00:22:41,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:22:41" (1/1) ... [2019-11-16 00:22:41,078 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:22:41,131 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:22:41,542 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:22:41,550 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:22:41,585 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:22:41,626 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:22:41,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:41 WrapperNode [2019-11-16 00:22:41,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:22:41,627 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:22:41,627 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:22:41,627 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:22:41,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:41" (1/1) ... [2019-11-16 00:22:41,648 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:41" (1/1) ... [2019-11-16 00:22:41,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:22:41,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:22:41,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:22:41,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:22:41,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:41" (1/1) ... [2019-11-16 00:22:41,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:41" (1/1) ... [2019-11-16 00:22:41,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:41" (1/1) ... [2019-11-16 00:22:41,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:41" (1/1) ... [2019-11-16 00:22:41,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:41" (1/1) ... [2019-11-16 00:22:41,688 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:41" (1/1) ... [2019-11-16 00:22:41,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:41" (1/1) ... [2019-11-16 00:22:41,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:22:41,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:22:41,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:22:41,693 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:22:41,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9761715c-b810-4e59-b302-138966d92f13/bin/uautomizer/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-16 00:22:41,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:22:41,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:22:41,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:22:41,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:22:41,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:22:41,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:22:42,021 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:22:42,021 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:22:42,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:22:42 BoogieIcfgContainer [2019-11-16 00:22:42,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:22:42,023 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:22:42,023 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:22:42,026 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:22:42,027 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:22:42,027 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:22:41" (1/3) ... [2019-11-16 00:22:42,028 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6dfbe767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:22:42, skipping insertion in model container [2019-11-16 00:22:42,028 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:22:42,028 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:41" (2/3) ... [2019-11-16 00:22:42,029 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6dfbe767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:22:42, skipping insertion in model container [2019-11-16 00:22:42,029 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:22:42,029 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:22:42" (3/3) ... [2019-11-16 00:22:42,030 INFO L371 chiAutomizerObserver]: Analyzing ICFG b.15-alloca.i [2019-11-16 00:22:42,071 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:22:42,072 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:22:42,072 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:22:42,072 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:22:42,072 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:22:42,072 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:22:42,073 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:22:42,073 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:22:42,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-16 00:22:42,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:22:42,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:22:42,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:22:42,111 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:22:42,112 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:22:42,112 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:22:42,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-16 00:22:42,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:22:42,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:22:42,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:22:42,114 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:22:42,114 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:22:42,121 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 13#L558-4true [2019-11-16 00:22:42,122 INFO L793 eck$LassoCheckResult]: Loop: 13#L558-4true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 8#L557-1true assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 14#L557-3true assume !!test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 11#L558-3true assume !true; 13#L558-4true [2019-11-16 00:22:42,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:42,127 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-16 00:22:42,134 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:42,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637187585] [2019-11-16 00:22:42,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:42,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:42,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:42,324 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:42,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:42,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1142256, now seen corresponding path program 1 times [2019-11-16 00:22:42,325 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:42,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940907653] [2019-11-16 00:22:42,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:42,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:42,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:42,361 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-16 00:22:42,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940907653] [2019-11-16 00:22:42,362 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:42,363 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-16 00:22:42,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868439122] [2019-11-16 00:22:42,367 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:22:42,368 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:42,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-16 00:22:42,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:22:42,384 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2019-11-16 00:22:42,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:42,390 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-11-16 00:22:42,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:22:42,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2019-11-16 00:22:42,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:22:42,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 9 transitions. [2019-11-16 00:22:42,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-16 00:22:42,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-16 00:22:42,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2019-11-16 00:22:42,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:22:42,399 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-16 00:22:42,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2019-11-16 00:22:42,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-11-16 00:22:42,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-16 00:22:42,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-11-16 00:22:42,424 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-16 00:22:42,424 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-16 00:22:42,424 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:22:42,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-11-16 00:22:42,425 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:22:42,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:22:42,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:22:42,425 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:22:42,425 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:22:42,426 INFO L791 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 33#L558-4 [2019-11-16 00:22:42,426 INFO L793 eck$LassoCheckResult]: Loop: 33#L558-4 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 37#L557-1 assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 38#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 36#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 35#L558-1 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12; 33#L558-4 [2019-11-16 00:22:42,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:42,427 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-16 00:22:42,427 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:42,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913031659] [2019-11-16 00:22:42,427 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:42,427 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:42,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:42,489 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:42,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:42,489 INFO L82 PathProgramCache]: Analyzing trace with hash 35409745, now seen corresponding path program 1 times [2019-11-16 00:22:42,490 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:42,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172092754] [2019-11-16 00:22:42,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:42,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:42,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:42,594 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-16 00:22:42,595 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172092754] [2019-11-16 00:22:42,595 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:42,595 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:22:42,595 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832900750] [2019-11-16 00:22:42,595 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:22:42,596 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:42,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:22:42,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:22:42,596 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 6 states. [2019-11-16 00:22:42,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:42,739 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-11-16 00:22:42,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:22:42,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2019-11-16 00:22:42,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-16 00:22:42,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 12 transitions. [2019-11-16 00:22:42,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-16 00:22:42,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-16 00:22:42,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2019-11-16 00:22:42,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:22:42,742 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-11-16 00:22:42,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2019-11-16 00:22:42,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-11-16 00:22:42,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-16 00:22:42,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-11-16 00:22:42,743 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-16 00:22:42,743 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-16 00:22:42,744 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:22:42,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2019-11-16 00:22:42,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-16 00:22:42,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:22:42,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:22:42,745 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:22:42,745 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2019-11-16 00:22:42,745 INFO L791 eck$LassoCheckResult]: Stem: 66#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 64#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 65#L558-4 [2019-11-16 00:22:42,745 INFO L793 eck$LassoCheckResult]: Loop: 65#L558-4 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 69#L557-1 assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 70#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 72#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 67#L558-1 assume !!(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14; 68#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 71#L558-1 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12; 65#L558-4 [2019-11-16 00:22:42,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:42,746 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-11-16 00:22:42,746 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:42,746 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732157548] [2019-11-16 00:22:42,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:42,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:42,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:42,817 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:42,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:42,817 INFO L82 PathProgramCache]: Analyzing trace with hash -330970762, now seen corresponding path program 1 times [2019-11-16 00:22:42,818 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:42,818 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219867037] [2019-11-16 00:22:42,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:42,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:42,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:42,862 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:42,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:42,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1215326068, now seen corresponding path program 1 times [2019-11-16 00:22:42,863 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:42,863 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642852824] [2019-11-16 00:22:42,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:42,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:42,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:42,967 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:43,271 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2019-11-16 00:22:44,083 WARN L191 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2019-11-16 00:22:44,331 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-11-16 00:22:44,347 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:22:44,348 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:22:44,348 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:22:44,348 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:22:44,349 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:22:44,349 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:44,349 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:22:44,349 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:22:44,349 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.15-alloca.i_Iteration3_Lasso [2019-11-16 00:22:44,349 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:22:44,349 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:22:44,370 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-16 00:22:44,374 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-16 00:22:44,381 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-16 00:22:44,388 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-16 00:22:44,390 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-16 00:22:44,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-16 00:22:44,402 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-16 00:22:44,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-16 00:22:44,407 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-16 00:22:44,410 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-16 00:22:44,413 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-16 00:22:44,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-16 00:22:45,082 WARN L191 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 98 [2019-11-16 00:22:45,262 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-11-16 00:22:45,262 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-16 00:22:45,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:45,266 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-16 00:22:45,267 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-16 00:22:45,270 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-16 00:22:45,272 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-16 00:22:45,274 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-16 00:22:45,276 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-16 00:22:46,692 WARN L191 SmtUtils]: Spent 884.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-11-16 00:22:46,752 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:22:46,756 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:22:46,758 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-16 00:22:46,759 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:46,759 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:46,760 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:46,760 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:46,760 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:46,762 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:46,762 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:46,763 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:46,764 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-16 00:22:46,764 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:46,764 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:46,765 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:46,765 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:46,765 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:46,765 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:46,766 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:46,766 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:46,767 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-16 00:22:46,767 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:46,768 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:46,768 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:46,768 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:46,768 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:46,769 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:46,769 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:46,770 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:46,770 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-16 00:22:46,771 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:46,771 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:46,771 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:46,771 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:46,772 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:46,772 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:46,772 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:46,773 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:46,773 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-16 00:22:46,774 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:46,774 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:46,774 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:46,775 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:46,775 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:46,775 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:46,776 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:46,776 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:46,777 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-16 00:22:46,777 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:46,778 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:46,778 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:46,778 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:46,780 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:46,780 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:46,783 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:46,783 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-16 00:22:46,784 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:46,784 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:46,784 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:46,784 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:46,785 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:46,785 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:46,785 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:46,786 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:46,786 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-16 00:22:46,787 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:46,787 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:46,788 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:46,788 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:46,788 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:46,789 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:46,789 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:46,790 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:46,790 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-16 00:22:46,791 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:46,791 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:46,791 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:46,791 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:46,793 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:46,793 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:46,796 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:46,797 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-16 00:22:46,797 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:46,798 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:46,798 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:46,798 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:46,799 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:46,800 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:46,801 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:46,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-16 00:22:46,803 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:46,803 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:46,803 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:46,803 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:46,803 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:46,804 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:46,804 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:46,805 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:46,805 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-16 00:22:46,806 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:46,806 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:46,806 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:46,806 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:46,808 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:46,808 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:46,811 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:46,812 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-16 00:22:46,812 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:46,812 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:46,813 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:46,813 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:46,814 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:46,815 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:46,816 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:46,817 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-16 00:22:46,818 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:46,818 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:46,818 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:46,818 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:46,823 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:46,823 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:46,869 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:22:46,902 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:22:46,903 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-16 00:22:46,905 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:22:46,906 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:22:46,906 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:22:46,907 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)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 Supporting invariants [] [2019-11-16 00:22:47,069 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2019-11-16 00:22:47,077 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:22:47,077 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:22:47,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:47,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:22:47,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:47,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:22:47,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:47,200 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:47,201 INFO L375 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 30 treesize of output 24 [2019-11-16 00:22:47,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:22:47,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-16 00:22:47,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:47,236 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:22:47,236 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:22 [2019-11-16 00:22:47,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:22:47,308 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-16 00:22:47,311 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-16 00:22:47,312 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand 6 states. [2019-11-16 00:22:47,507 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 3. Second operand 6 states. Result 16 states and 21 transitions. Complement of second has 10 states. [2019-11-16 00:22:47,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-16 00:22:47,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-16 00:22:47,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2019-11-16 00:22:47,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 2 letters. Loop has 7 letters. [2019-11-16 00:22:47,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:47,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 9 letters. Loop has 7 letters. [2019-11-16 00:22:47,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:47,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 2 letters. Loop has 14 letters. [2019-11-16 00:22:47,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:47,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 21 transitions. [2019-11-16 00:22:47,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:22:47,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 21 transitions. [2019-11-16 00:22:47,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-16 00:22:47,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-16 00:22:47,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2019-11-16 00:22:47,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:22:47,513 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-16 00:22:47,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2019-11-16 00:22:47,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-11-16 00:22:47,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-16 00:22:47,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-11-16 00:22:47,515 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-16 00:22:47,515 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-16 00:22:47,515 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:22:47,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-11-16 00:22:47,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:22:47,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:22:47,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:22:47,517 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:22:47,517 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:22:47,517 INFO L791 eck$LassoCheckResult]: Stem: 300#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 298#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 299#L558-4 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 305#L557-1 assume !test_fun_#t~short10; 306#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 302#L558-3 [2019-11-16 00:22:47,517 INFO L793 eck$LassoCheckResult]: Loop: 302#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 301#L558-1 assume !!(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14; 302#L558-3 [2019-11-16 00:22:47,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:47,518 INFO L82 PathProgramCache]: Analyzing trace with hash 28695850, now seen corresponding path program 1 times [2019-11-16 00:22:47,518 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:47,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997548070] [2019-11-16 00:22:47,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:47,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:47,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:47,546 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-16 00:22:47,547 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997548070] [2019-11-16 00:22:47,547 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:47,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:22:47,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132210489] [2019-11-16 00:22:47,547 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:22:47,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:47,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 1 times [2019-11-16 00:22:47,548 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:47,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006205562] [2019-11-16 00:22:47,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:47,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:47,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:47,570 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:47,633 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:47,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:47,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:47,634 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-16 00:22:47,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:47,643 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-11-16 00:22:47,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:47,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2019-11-16 00:22:47,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:22:47,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 17 transitions. [2019-11-16 00:22:47,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-16 00:22:47,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-16 00:22:47,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2019-11-16 00:22:47,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:22:47,645 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-16 00:22:47,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2019-11-16 00:22:47,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-16 00:22:47,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-16 00:22:47,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-11-16 00:22:47,647 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-16 00:22:47,647 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-16 00:22:47,647 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:22:47,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2019-11-16 00:22:47,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:22:47,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:22:47,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:22:47,648 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:22:47,648 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:22:47,649 INFO L791 eck$LassoCheckResult]: Stem: 336#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 334#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 335#L558-4 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 341#L557-1 assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 342#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 338#L558-3 [2019-11-16 00:22:47,649 INFO L793 eck$LassoCheckResult]: Loop: 338#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 337#L558-1 assume !!(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14; 338#L558-3 [2019-11-16 00:22:47,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:47,649 INFO L82 PathProgramCache]: Analyzing trace with hash 28695788, now seen corresponding path program 1 times [2019-11-16 00:22:47,649 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:47,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741827816] [2019-11-16 00:22:47,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:47,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:47,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:47,684 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:47,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:47,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 2 times [2019-11-16 00:22:47,684 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:47,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929859173] [2019-11-16 00:22:47,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:47,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:47,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:47,695 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:47,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:47,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849233, now seen corresponding path program 1 times [2019-11-16 00:22:47,696 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:47,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732346206] [2019-11-16 00:22:47,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:47,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:47,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:47,731 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:48,455 WARN L191 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 125 [2019-11-16 00:22:48,673 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-11-16 00:22:48,676 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:22:48,676 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:22:48,676 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:22:48,676 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:22:48,676 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:22:48,677 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:48,677 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:22:48,677 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:22:48,677 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.15-alloca.i_Iteration5_Lasso [2019-11-16 00:22:48,677 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:22:48,677 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:22:48,681 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-16 00:22:48,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:48,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:48,691 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-16 00:22:48,692 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-16 00:22:48,694 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-16 00:22:48,698 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-16 00:22:48,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:48,709 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-16 00:22:48,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:48,730 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-16 00:22:48,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:48,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:48,736 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-16 00:22:48,739 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-16 00:22:48,746 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-16 00:22:48,748 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-16 00:22:48,750 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-16 00:22:48,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:49,256 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 102 [2019-11-16 00:22:49,387 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-11-16 00:22:50,734 WARN L191 SmtUtils]: Spent 826.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-11-16 00:22:50,770 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:22:50,770 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:22:50,771 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-16 00:22:50,771 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:50,772 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:50,772 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:50,772 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:50,772 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:50,772 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:50,773 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:50,773 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:50,774 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-16 00:22:50,774 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:50,774 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:50,775 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:50,775 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:50,775 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:50,775 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:50,775 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:50,776 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:50,776 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-16 00:22:50,777 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:50,777 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:50,777 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:50,777 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:50,778 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:50,778 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:50,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:50,780 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-16 00:22:50,781 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:50,781 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:50,782 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:50,782 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:50,782 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:50,782 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:50,783 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:50,783 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:50,784 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-16 00:22:50,784 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:50,785 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:50,785 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:50,785 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:50,785 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:50,785 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:50,786 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:50,786 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:50,786 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-16 00:22:50,787 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:50,787 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:50,787 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:50,787 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:50,789 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:50,789 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:50,792 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:50,792 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-16 00:22:50,792 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:50,793 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:50,793 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:50,793 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:50,793 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:50,793 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:50,793 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:50,795 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:50,796 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-16 00:22:50,796 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:50,796 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:50,796 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:50,797 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:50,797 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:50,797 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:50,797 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:50,798 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:50,798 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-16 00:22:50,799 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:50,799 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:50,799 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:50,799 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:50,799 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:50,800 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:50,800 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:50,800 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:50,801 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-16 00:22:50,801 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:50,801 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:50,801 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:50,802 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:50,802 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:50,802 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:50,802 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:50,803 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:50,803 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-16 00:22:50,803 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:50,804 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:50,804 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:50,804 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:50,805 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:50,805 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:50,806 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:50,807 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-16 00:22:50,807 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:50,807 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:50,808 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:50,808 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:50,808 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:50,808 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:50,808 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:50,809 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:50,809 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-16 00:22:50,810 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:50,810 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:50,810 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:50,810 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:50,810 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:50,810 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:50,811 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:50,811 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:50,812 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-16 00:22:50,812 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:50,812 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:50,812 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:50,813 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:50,813 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:50,813 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:50,815 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:50,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:22:50,815 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:50,816 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:50,816 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:50,816 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:50,816 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:50,816 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:50,817 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:50,817 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:50,817 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-16 00:22:50,818 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:50,818 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:50,818 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:50,818 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:50,818 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:50,819 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:50,819 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:50,819 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:50,820 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-16 00:22:50,820 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:50,820 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:50,820 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:50,821 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:50,821 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:50,821 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:50,821 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:50,822 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:50,822 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-16 00:22:50,823 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:50,823 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:50,823 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:50,823 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:50,824 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:50,824 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:50,827 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:50,827 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-16 00:22:50,827 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:50,828 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:50,828 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:50,828 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:50,829 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:50,829 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:50,831 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:50,831 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-16 00:22:50,832 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:50,832 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:50,832 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:50,832 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:50,833 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:50,833 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:50,837 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:50,838 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-16 00:22:50,838 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:50,838 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:50,839 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:50,839 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:50,840 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:50,840 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:50,843 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:50,844 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-16 00:22:50,844 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:50,845 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:50,845 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:50,845 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:50,848 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:50,848 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:50,864 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:50,864 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-16 00:22:50,865 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:50,865 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:50,865 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:50,865 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:50,866 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:50,866 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:50,868 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:50,868 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-16 00:22:50,868 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:50,869 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:50,869 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:50,869 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:50,870 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:50,870 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:50,871 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:50,872 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-16 00:22:50,872 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:50,872 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:50,873 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:50,873 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:50,873 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:50,874 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:50,875 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:50,875 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-16 00:22:50,876 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:50,876 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:50,876 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:50,876 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:50,877 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:50,877 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:50,881 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:50,881 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-16 00:22:50,882 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:50,882 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:50,882 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:50,882 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:50,883 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:50,883 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:50,887 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:50,887 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-16 00:22:50,888 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:50,888 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:50,888 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:50,889 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:50,891 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:22:50,891 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:22:50,908 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:22:50,927 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:22:50,927 INFO L444 ModelExtractionUtils]: 32 out of 40 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-16 00:22:50,928 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:22:50,928 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:22:50,929 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:22:50,929 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)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 Supporting invariants [] [2019-11-16 00:22:51,056 INFO L297 tatePredicateManager]: 39 out of 41 supporting invariants were superfluous and have been removed [2019-11-16 00:22:51,060 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:22:51,060 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:22:51,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:51,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-16 00:22:51,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:51,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:22:51,142 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:51,143 INFO L375 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 19 treesize of output 19 [2019-11-16 00:22:51,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:22:51,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:22:51,165 INFO L567 ElimStorePlain]: treesize reduction 1, result has 94.4 percent of original size [2019-11-16 00:22:51,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:22:51,166 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:17 [2019-11-16 00:22:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:51,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:22:51,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:51,225 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-16 00:22:51,225 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-11-16 00:22:51,226 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-11-16 00:22:51,334 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 32 states and 37 transitions. Complement of second has 8 states. [2019-11-16 00:22:51,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:22:51,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:22:51,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-11-16 00:22:51,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-16 00:22:51,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:51,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-16 00:22:51,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:51,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-16 00:22:51,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:51,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2019-11-16 00:22:51,338 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:22:51,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2019-11-16 00:22:51,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:22:51,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:22:51,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:22:51,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:22:51,339 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:22:51,339 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:22:51,339 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:22:51,339 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:22:51,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:22:51,339 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:22:51,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:22:51,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:22:51 BoogieIcfgContainer [2019-11-16 00:22:51,344 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:22:51,344 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:22:51,344 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:22:51,344 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:22:51,344 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:22:42" (3/4) ... [2019-11-16 00:22:51,347 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:22:51,347 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:22:51,348 INFO L168 Benchmark]: Toolchain (without parser) took 10292.11 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.3 MB). Free memory was 939.4 MB in the beginning and 949.5 MB in the end (delta: -10.1 MB). Peak memory consumption was 298.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:22:51,349 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:22:51,349 INFO L168 Benchmark]: CACSL2BoogieTranslator took 569.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:22:51,350 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.65 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:22:51,350 INFO L168 Benchmark]: Boogie Preprocessor took 24.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:22:51,351 INFO L168 Benchmark]: RCFGBuilder took 330.17 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: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:22:51,352 INFO L168 Benchmark]: BuchiAutomizer took 9320.43 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.8 MB). Free memory was 1.1 GB in the beginning and 949.5 MB in the end (delta: 145.3 MB). Peak memory consumption was 313.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:22:51,352 INFO L168 Benchmark]: Witness Printer took 3.22 ms. Allocated memory is still 1.3 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:22:51,355 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 569.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.65 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 330.17 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: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9320.43 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.8 MB). Free memory was 1.1 GB in the beginning and 949.5 MB in the end (delta: 145.3 MB). Peak memory consumption was 313.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.22 ms. Allocated memory is still 1.3 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 5 terminating modules (3 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] + -1 * unknown-#memory_int-unknown[z_ref][z_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] + -1 * unknown-#memory_int-unknown[z_ref][z_ref] and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.2s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 8.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 34 SDtfs, 18 SDslu, 19 SDs, 0 SdLazy, 64 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital443 mio100 ax104 hnf100 lsp94 ukn53 mio100 lsp32 div100 bol100 ite100 ukn100 eq191 hnf88 smp97 dnf693 smp90 tf100 neg91 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms 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...