./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/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 32bit --witnessprinter.graph.data.programhash 55606309cae57397ff6f26c0cb83fe02a5a029bc ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:58:24,560 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:58:24,562 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:58:24,572 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:58:24,573 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:58:24,574 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:58:24,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:58:24,578 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:58:24,580 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:58:24,581 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:58:24,582 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:58:24,583 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:58:24,584 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:58:24,585 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:58:24,586 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:58:24,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:58:24,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:58:24,589 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:58:24,591 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:58:24,593 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:58:24,595 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:58:24,596 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:58:24,597 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:58:24,598 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:58:24,600 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:58:24,600 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:58:24,601 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:58:24,601 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:58:24,602 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:58:24,603 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:58:24,603 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:58:24,604 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:58:24,604 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:58:24,605 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:58:24,606 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:58:24,606 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:58:24,607 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:58:24,607 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:58:24,608 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:58:24,608 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:58:24,609 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:58:24,610 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-25 08:58:24,625 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:58:24,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:58:24,626 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:58:24,627 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:58:24,627 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:58:24,627 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-25 08:58:24,627 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-25 08:58:24,627 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-25 08:58:24,628 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-25 08:58:24,628 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-25 08:58:24,628 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-25 08:58:24,628 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:58:24,629 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:58:24,629 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:58:24,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:58:24,629 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:58:24,629 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:58:24,630 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-25 08:58:24,630 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-25 08:58:24,630 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-25 08:58:24,630 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:58:24,631 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:58:24,631 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-25 08:58:24,631 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:58:24,631 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-25 08:58:24,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:58:24,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:58:24,632 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-25 08:58:24,632 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:58:24,633 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:58:24,633 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-25 08:58:24,634 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-25 08:58:24,634 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_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 55606309cae57397ff6f26c0cb83fe02a5a029bc [2019-11-25 08:58:24,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:58:24,787 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:58:24,791 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:58:24,792 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:58:24,793 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:58:24,793 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2019-11-25 08:58:24,844 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/data/d17e71c42/47993aba8f4547418b060f2c63599873/FLAG1916fcdf1 [2019-11-25 08:58:25,298 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:58:25,304 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2019-11-25 08:58:25,318 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/data/d17e71c42/47993aba8f4547418b060f2c63599873/FLAG1916fcdf1 [2019-11-25 08:58:25,338 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/data/d17e71c42/47993aba8f4547418b060f2c63599873 [2019-11-25 08:58:25,341 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:58:25,342 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:58:25,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:58:25,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:58:25,348 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:58:25,349 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:58:25" (1/1) ... [2019-11-25 08:58:25,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@873cc76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:25, skipping insertion in model container [2019-11-25 08:58:25,351 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:58:25" (1/1) ... [2019-11-25 08:58:25,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:58:25,393 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:58:25,752 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:58:25,763 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:58:25,800 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:58:25,863 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:58:25,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:25 WrapperNode [2019-11-25 08:58:25,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:58:25,865 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:58:25,865 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:58:25,865 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:58:25,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:25" (1/1) ... [2019-11-25 08:58:25,897 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:25" (1/1) ... [2019-11-25 08:58:25,919 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:58:25,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:58:25,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:58:25,920 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:58:25,928 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:25" (1/1) ... [2019-11-25 08:58:25,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:25" (1/1) ... [2019-11-25 08:58:25,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:25" (1/1) ... [2019-11-25 08:58:25,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:25" (1/1) ... [2019-11-25 08:58:25,939 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:25" (1/1) ... [2019-11-25 08:58:25,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:25" (1/1) ... [2019-11-25 08:58:25,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:25" (1/1) ... [2019-11-25 08:58:25,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:58:25,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:58:25,949 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:58:25,949 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:58:25,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/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-25 08:58:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 08:58:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:58:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 08:58:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 08:58:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:58:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-25 08:58:26,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:58:26,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:58:26,424 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:58:26,425 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-25 08:58:26,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:58:26 BoogieIcfgContainer [2019-11-25 08:58:26,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:58:26,427 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-25 08:58:26,427 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-25 08:58:26,430 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-25 08:58:26,430 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:58:26,431 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 08:58:25" (1/3) ... [2019-11-25 08:58:26,432 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@379bb840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:58:26, skipping insertion in model container [2019-11-25 08:58:26,432 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:58:26,432 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:25" (2/3) ... [2019-11-25 08:58:26,433 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@379bb840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:58:26, skipping insertion in model container [2019-11-25 08:58:26,433 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:58:26,433 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:58:26" (3/3) ... [2019-11-25 08:58:26,435 INFO L371 chiAutomizerObserver]: Analyzing ICFG test-0232_1-2.i [2019-11-25 08:58:26,475 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-25 08:58:26,475 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-25 08:58:26,475 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-25 08:58:26,475 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:58:26,476 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:58:26,476 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-25 08:58:26,476 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:58:26,476 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-25 08:58:26,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-25 08:58:26,507 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-25 08:58:26,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:58:26,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:58:26,514 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-25 08:58:26,514 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-25 08:58:26,514 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-25 08:58:26,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-25 08:58:26,516 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-25 08:58:26,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:58:26,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:58:26,517 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-25 08:58:26,517 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-25 08:58:26,524 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~c~0 := 0; 4#L-1true havoc main_#res;havoc main_#t~post11, main_#t~nondet10, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~post17, main_~next~0.base, main_~next~0.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~post21, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 11#L532-3true [2019-11-25 08:58:26,525 INFO L796 eck$LassoCheckResult]: Loop: 11#L532-3true append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 3#L523true assume append_#t~mem5.base != 0 || append_#t~mem5.offset != 0;call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_#t~mem6.base, 4 + append_#t~mem6.offset, 4);append_#t~ite9.base, append_#t~ite9.offset := append_#t~mem7.base, append_#t~mem7.offset; 5#L523-2true call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 12#L518true main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 8#L532-1true assume !!(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 11#L532-3true [2019-11-25 08:58:26,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:26,531 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-25 08:58:26,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:26,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854325352] [2019-11-25 08:58:26,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:26,644 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:26,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:26,645 INFO L82 PathProgramCache]: Analyzing trace with hash 34451375, now seen corresponding path program 1 times [2019-11-25 08:58:26,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:26,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990896524] [2019-11-25 08:58:26,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:26,712 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:26,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:26,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1805890861, now seen corresponding path program 1 times [2019-11-25 08:58:26,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:26,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887445936] [2019-11-25 08:58:26,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:26,823 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-25 08:58:26,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887445936] [2019-11-25 08:58:26,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:26,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:58:26,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594879981] [2019-11-25 08:58:27,754 WARN L192 SmtUtils]: Spent 919.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 125 [2019-11-25 08:58:28,378 WARN L192 SmtUtils]: Spent 607.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-25 08:58:28,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:28,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:58:28,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:58:28,395 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 4 states. [2019-11-25 08:58:28,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:28,465 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-11-25 08:58:28,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:58:28,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2019-11-25 08:58:28,469 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-25 08:58:28,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 13 states and 16 transitions. [2019-11-25 08:58:28,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-25 08:58:28,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-25 08:58:28,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2019-11-25 08:58:28,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:58:28,479 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-11-25 08:58:28,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2019-11-25 08:58:28,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-11-25 08:58:28,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-25 08:58:28,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-11-25 08:58:28,508 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-25 08:58:28,508 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-25 08:58:28,509 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-25 08:58:28,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-11-25 08:58:28,511 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-25 08:58:28,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:58:28,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:58:28,512 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-25 08:58:28,512 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-25 08:58:28,512 INFO L794 eck$LassoCheckResult]: Stem: 52#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~c~0 := 0; 44#L-1 havoc main_#res;havoc main_#t~post11, main_#t~nondet10, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~post17, main_~next~0.base, main_~next~0.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~post21, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 45#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 54#L523 assume !(append_#t~mem5.base != 0 || append_#t~mem5.offset != 0);call append_#t~malloc8.base, append_#t~malloc8.offset := #Ultimate.allocOnHeap(8);append_#t~ite9.base, append_#t~ite9.offset := append_#t~malloc8.base, append_#t~malloc8.offset; 46#L523-2 [2019-11-25 08:58:28,513 INFO L796 eck$LassoCheckResult]: Loop: 46#L523-2 call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 47#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 49#L532-1 assume !!(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 51#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 53#L523 assume append_#t~mem5.base != 0 || append_#t~mem5.offset != 0;call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_#t~mem6.base, 4 + append_#t~mem6.offset, 4);append_#t~ite9.base, append_#t~ite9.offset := append_#t~mem7.base, append_#t~mem7.offset; 46#L523-2 [2019-11-25 08:58:28,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:28,514 INFO L82 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2019-11-25 08:58:28,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:28,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77438492] [2019-11-25 08:58:28,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:28,615 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:28,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:28,616 INFO L82 PathProgramCache]: Analyzing trace with hash 41102165, now seen corresponding path program 2 times [2019-11-25 08:58:28,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:28,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088777469] [2019-11-25 08:58:28,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:28,661 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:28,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:28,662 INFO L82 PathProgramCache]: Analyzing trace with hash 351588334, now seen corresponding path program 1 times [2019-11-25 08:58:28,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:28,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603277326] [2019-11-25 08:58:28,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:28,760 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:29,463 WARN L192 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 142 [2019-11-25 08:58:30,401 WARN L192 SmtUtils]: Spent 933.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-11-25 08:58:30,761 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 107 [2019-11-25 08:58:30,881 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-11-25 08:58:30,893 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:58:30,894 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:58:30,894 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:58:30,894 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:58:30,894 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:58:30,894 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:30,894 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:58:30,894 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:58:30,895 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-0232_1-2.i_Iteration2_Lasso [2019-11-25 08:58:30,895 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:58:30,895 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:58:30,927 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-25 08:58:30,938 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-25 08:58:30,941 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-25 08:58:30,943 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-25 08:58:30,946 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-25 08:58:30,955 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-25 08:58:30,958 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-25 08:58:30,960 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-25 08:58:30,962 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-25 08:58:30,964 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-25 08:58:30,967 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-25 08:58:30,969 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-25 08:58:30,971 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-25 08:58:30,973 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-25 08:58:30,976 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-25 08:58:30,979 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-25 08:58:30,982 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-25 08:58:30,986 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-25 08:58:30,988 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-25 08:58:30,994 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-25 08:58:30,997 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-25 08:58:30,998 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-25 08:58:31,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:31,456 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-11-25 08:58:32,806 WARN L192 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 140 DAG size of output: 122 [2019-11-25 08:58:32,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:32,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:32,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:32,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:32,832 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-25 08:58:32,834 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-25 08:58:32,836 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-25 08:58:32,839 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-25 08:58:32,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:32,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:58:32,846 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-25 08:58:32,849 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-25 08:58:32,851 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-25 08:58:33,095 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-25 08:58:33,369 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-11-25 08:58:34,675 WARN L192 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 83 DAG size of output: 83 [2019-11-25 08:58:39,188 WARN L192 SmtUtils]: Spent 4.51 s on a formula simplification. DAG size of input: 136 DAG size of output: 136 [2019-11-25 08:58:39,306 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:58:39,311 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:39,332 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-25 08:58:39,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:39,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:39,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:39,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:39,344 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:39,344 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:58:39,350 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:58:39,362 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-25 08:58:39,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:39,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:39,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:39,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:39,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:39,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:39,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:39,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:39,386 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-25 08:58:39,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:39,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:39,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:39,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:39,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:39,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:39,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:39,392 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:39,409 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-25 08:58:39,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:39,412 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:39,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:39,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:39,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:39,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:39,413 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:39,415 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:39,419 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-25 08:58:39,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:39,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:39,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:39,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:39,424 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:39,424 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:58:39,429 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:58:39,452 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-25 08:58:39,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:39,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:39,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:39,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:39,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:39,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:39,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:39,460 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:39,478 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-25 08:58:39,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:39,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:39,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:39,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:39,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:39,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:39,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:39,485 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:39,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:58:39,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:39,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:39,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:39,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:39,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:39,494 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:39,494 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:39,495 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:39,502 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:58:39,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:39,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:39,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:39,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:39,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:39,505 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:39,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:39,506 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:39,517 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-25 08:58:39,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:39,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:39,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:39,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:39,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:39,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:39,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:39,523 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:39,528 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-25 08:58:39,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:39,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:39,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:39,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:39,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:39,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:39,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:39,532 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:39,537 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-25 08:58:39,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:39,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:39,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:39,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:39,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:39,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:39,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:39,540 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:39,545 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-25 08:58:39,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:39,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:39,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:39,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:39,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:39,548 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:39,548 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:39,549 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:39,553 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-25 08:58:39,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:39,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:39,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:39,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:39,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:39,556 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:39,556 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:39,557 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:39,566 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-25 08:58:39,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:39,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:39,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:39,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:39,570 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:39,570 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:58:39,574 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:39,580 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-25 08:58:39,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:39,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:39,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:39,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:39,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:39,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:39,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:39,584 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:39,601 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-25 08:58:39,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:39,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:39,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:39,603 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-25 08:58:39,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:39,604 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-25 08:58:39,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:39,606 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:39,610 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-25 08:58:39,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:39,611 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:58:39,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:39,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:39,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:39,612 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:58:39,612 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:58:39,613 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:39,635 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-25 08:58:39,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:58:39,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:58:39,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:58:39,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:58:39,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:58:39,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:58:39,648 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:58:39,682 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-25 08:58:39,683 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:58:39,693 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:39,696 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-25 08:58:39,696 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:58:39,697 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~c~0) = -2*~c~0 + 39 Supporting invariants [] [2019-11-25 08:58:39,756 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-11-25 08:58:39,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:39,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:58:39,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:58:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:39,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:58:39,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:58:39,902 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-25 08:58:39,905 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-25 08:58:39,905 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-11-25 08:58:39,943 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 19 states and 26 transitions. Complement of second has 6 states. [2019-11-25 08:58:39,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-25 08:58:39,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-25 08:58:39,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-25 08:58:39,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 5 letters. [2019-11-25 08:58:39,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:58:39,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 5 letters. [2019-11-25 08:58:39,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:58:39,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 10 letters. [2019-11-25 08:58:39,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:58:39,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-11-25 08:58:39,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-25 08:58:39,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 16 states and 21 transitions. [2019-11-25 08:58:39,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-25 08:58:39,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-25 08:58:39,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2019-11-25 08:58:39,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:58:39,952 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-25 08:58:39,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2019-11-25 08:58:39,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-11-25 08:58:39,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-25 08:58:39,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-11-25 08:58:39,954 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-25 08:58:39,954 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-25 08:58:39,954 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-25 08:58:39,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-11-25 08:58:39,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-25 08:58:39,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:58:39,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:58:39,956 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:39,956 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-25 08:58:39,956 INFO L794 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~c~0 := 0; 153#L-1 havoc main_#res;havoc main_#t~post11, main_#t~nondet10, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~post17, main_~next~0.base, main_~next~0.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~post21, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 154#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 165#L523 assume !(append_#t~mem5.base != 0 || append_#t~mem5.offset != 0);call append_#t~malloc8.base, append_#t~malloc8.offset := #Ultimate.allocOnHeap(8);append_#t~ite9.base, append_#t~ite9.offset := append_#t~malloc8.base, append_#t~malloc8.offset; 167#L523-2 call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 156#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 160#L532-1 assume !(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 161#L532-4 assume !(main_~length~0 > 0); 159#L543-1 [2019-11-25 08:58:39,956 INFO L796 eck$LassoCheckResult]: Loop: 159#L543-1 assume !!(main_~length~0 > 0);call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem18.base, main_#t~mem18.offset;call main_#t~mem20.base, main_#t~mem20.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem20.base, main_#t~mem20.offset);havoc main_#t~mem20.base, main_#t~mem20.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post21 := main_~length~0;main_~length~0 := main_#t~post21 - 1;havoc main_#t~post21; 159#L543-1 [2019-11-25 08:58:39,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:39,956 INFO L82 PathProgramCache]: Analyzing trace with hash 149888852, now seen corresponding path program 1 times [2019-11-25 08:58:39,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:39,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381608200] [2019-11-25 08:58:39,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:39,991 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-25 08:58:39,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381608200] [2019-11-25 08:58:39,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:39,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:58:39,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697621540] [2019-11-25 08:58:39,992 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:58:39,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:39,992 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 1 times [2019-11-25 08:58:39,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:39,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275872536] [2019-11-25 08:58:39,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:40,002 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:40,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:40,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:58:40,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:58:40,132 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-25 08:58:40,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:40,148 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-11-25 08:58:40,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:58:40,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2019-11-25 08:58:40,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-25 08:58:40,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 21 transitions. [2019-11-25 08:58:40,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-25 08:58:40,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-25 08:58:40,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2019-11-25 08:58:40,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:58:40,151 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-25 08:58:40,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2019-11-25 08:58:40,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2019-11-25 08:58:40,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-25 08:58:40,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-11-25 08:58:40,153 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-25 08:58:40,153 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-25 08:58:40,153 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-25 08:58:40,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-11-25 08:58:40,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-25 08:58:40,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:58:40,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:58:40,154 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:40,154 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-25 08:58:40,154 INFO L794 eck$LassoCheckResult]: Stem: 199#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~c~0 := 0; 192#L-1 havoc main_#res;havoc main_#t~post11, main_#t~nondet10, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~post17, main_~next~0.base, main_~next~0.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~post21, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 193#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 204#L523 assume !(append_#t~mem5.base != 0 || append_#t~mem5.offset != 0);call append_#t~malloc8.base, append_#t~malloc8.offset := #Ultimate.allocOnHeap(8);append_#t~ite9.base, append_#t~ite9.offset := append_#t~malloc8.base, append_#t~malloc8.offset; 206#L523-2 call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 195#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 200#L532-1 assume !(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 201#L532-4 assume main_~length~0 > 0;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, 4 + main_#t~mem14.offset, 4);call ULTIMATE.dealloc(main_#t~mem15.base, main_#t~mem15.offset);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem14.base, main_#t~mem14.offset;call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem16.base, main_#t~mem16.offset);havoc main_#t~mem16.base, main_#t~mem16.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post17 := main_~length~0;main_~length~0 := main_#t~post17 - 1;havoc main_#t~post17; 198#L543-1 [2019-11-25 08:58:40,155 INFO L796 eck$LassoCheckResult]: Loop: 198#L543-1 assume !!(main_~length~0 > 0);call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem18.base, main_#t~mem18.offset;call main_#t~mem20.base, main_#t~mem20.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem20.base, main_#t~mem20.offset);havoc main_#t~mem20.base, main_#t~mem20.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post21 := main_~length~0;main_~length~0 := main_#t~post21 - 1;havoc main_#t~post21; 198#L543-1 [2019-11-25 08:58:40,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:40,155 INFO L82 PathProgramCache]: Analyzing trace with hash 149888850, now seen corresponding path program 1 times [2019-11-25 08:58:40,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:40,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503028655] [2019-11-25 08:58:40,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:40,227 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:40,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:40,227 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 2 times [2019-11-25 08:58:40,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:40,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76500501] [2019-11-25 08:58:40,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:40,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:40,236 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:40,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:40,237 INFO L82 PathProgramCache]: Analyzing trace with hash 351587092, now seen corresponding path program 1 times [2019-11-25 08:58:40,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:40,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309728430] [2019-11-25 08:58:40,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:40,273 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-25 08:58:40,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309728430] [2019-11-25 08:58:40,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:40,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:58:40,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99806994] [2019-11-25 08:58:40,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:40,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:58:40,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:58:40,380 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 5 states. [2019-11-25 08:58:40,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:40,406 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2019-11-25 08:58:40,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:58:40,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 33 transitions. [2019-11-25 08:58:40,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-25 08:58:40,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 29 transitions. [2019-11-25 08:58:40,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-25 08:58:40,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-25 08:58:40,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2019-11-25 08:58:40,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:58:40,410 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-25 08:58:40,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2019-11-25 08:58:40,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 15. [2019-11-25 08:58:40,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-25 08:58:40,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-11-25 08:58:40,412 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-25 08:58:40,412 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-25 08:58:40,412 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-25 08:58:40,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2019-11-25 08:58:40,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-25 08:58:40,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:58:40,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:58:40,414 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-25 08:58:40,414 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-25 08:58:40,414 INFO L794 eck$LassoCheckResult]: Stem: 254#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~c~0 := 0; 244#L-1 havoc main_#res;havoc main_#t~post11, main_#t~nondet10, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~post17, main_~next~0.base, main_~next~0.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~post21, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 245#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 255#L523 assume !(append_#t~mem5.base != 0 || append_#t~mem5.offset != 0);call append_#t~malloc8.base, append_#t~malloc8.offset := #Ultimate.allocOnHeap(8);append_#t~ite9.base, append_#t~ite9.offset := append_#t~malloc8.base, append_#t~malloc8.offset; 246#L523-2 call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 247#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 252#L532-1 assume !!(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 253#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 256#L523 assume !(append_#t~mem5.base != 0 || append_#t~mem5.offset != 0);call append_#t~malloc8.base, append_#t~malloc8.offset := #Ultimate.allocOnHeap(8);append_#t~ite9.base, append_#t~ite9.offset := append_#t~malloc8.base, append_#t~malloc8.offset; 258#L523-2 call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 257#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 250#L532-1 assume !(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 251#L532-4 assume main_~length~0 > 0;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, 4 + main_#t~mem14.offset, 4);call ULTIMATE.dealloc(main_#t~mem15.base, main_#t~mem15.offset);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem14.base, main_#t~mem14.offset;call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem16.base, main_#t~mem16.offset);havoc main_#t~mem16.base, main_#t~mem16.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post17 := main_~length~0;main_~length~0 := main_#t~post17 - 1;havoc main_#t~post17; 249#L543-1 [2019-11-25 08:58:40,414 INFO L796 eck$LassoCheckResult]: Loop: 249#L543-1 assume !!(main_~length~0 > 0);call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem18.base, main_#t~mem18.offset;call main_#t~mem20.base, main_#t~mem20.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem20.base, main_#t~mem20.offset);havoc main_#t~mem20.base, main_#t~mem20.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post21 := main_~length~0;main_~length~0 := main_#t~post21 - 1;havoc main_#t~post21; 249#L543-1 [2019-11-25 08:58:40,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:40,415 INFO L82 PathProgramCache]: Analyzing trace with hash -315524230, now seen corresponding path program 1 times [2019-11-25 08:58:40,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:40,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110029066] [2019-11-25 08:58:40,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:40,506 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:58:40,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110029066] [2019-11-25 08:58:40,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237765295] [2019-11-25 08:58:40,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c70bf6cc-6e69-4fc9-8f85-c7b05c7a7ace/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:58:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:40,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-25 08:58:40,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:58:40,678 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:58:40,678 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 47 [2019-11-25 08:58:40,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:58:40,716 INFO L567 ElimStorePlain]: treesize reduction 20, result has 63.0 percent of original size [2019-11-25 08:58:40,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:58:40,718 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:12 [2019-11-25 08:58:40,745 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-25 08:58:40,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:58:40,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:58:40,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:58:40,748 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-11-25 08:58:40,749 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:58:40,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:58:40,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2019-11-25 08:58:40,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994287305] [2019-11-25 08:58:40,750 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:58:40,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:40,750 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 3 times [2019-11-25 08:58:40,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:40,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162931893] [2019-11-25 08:58:40,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:40,758 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:40,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:40,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:58:40,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:58:40,905 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 8 states. [2019-11-25 08:58:40,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:40,975 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-11-25 08:58:40,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:58:40,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2019-11-25 08:58:40,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-25 08:58:40,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2019-11-25 08:58:40,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-25 08:58:40,977 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-25 08:58:40,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2019-11-25 08:58:40,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:58:40,977 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-25 08:58:40,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2019-11-25 08:58:40,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-25 08:58:40,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-25 08:58:40,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-11-25 08:58:40,979 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-25 08:58:40,979 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-25 08:58:40,979 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-25 08:58:40,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2019-11-25 08:58:40,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-25 08:58:40,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:58:40,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:58:40,980 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:40,981 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-25 08:58:40,981 INFO L794 eck$LassoCheckResult]: Stem: 336#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~c~0 := 0; 325#L-1 havoc main_#res;havoc main_#t~post11, main_#t~nondet10, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~post17, main_~next~0.base, main_~next~0.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~post21, main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, main_~length~0;call main_~#list~0.base, main_~#list~0.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0.base, main_~#list~0.offset, 4);main_~length~0 := 0; 326#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 337#L523 assume !(append_#t~mem5.base != 0 || append_#t~mem5.offset != 0);call append_#t~malloc8.base, append_#t~malloc8.offset := #Ultimate.allocOnHeap(8);append_#t~ite9.base, append_#t~ite9.offset := append_#t~malloc8.base, append_#t~malloc8.offset; 339#L523-2 call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 330#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 334#L532-1 assume !!(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 335#L532-3 append_#in~plist.base, append_#in~plist.offset := main_~#list~0.base, main_~#list~0.offset;havoc append_#t~post2, append_#t~malloc3.base, append_#t~malloc3.offset, append_#t~mem4.base, append_#t~mem4.offset, append_#t~mem5.base, append_#t~mem5.offset, append_#t~ite9.base, append_#t~ite9.offset, append_#t~mem6.base, append_#t~mem6.offset, append_#t~mem7.base, append_#t~mem7.offset, append_#t~malloc8.base, append_#t~malloc8.offset, append_~plist.base, append_~plist.offset, append_~item~0.base, append_~item~0.offset;append_~plist.base, append_~plist.offset := append_#in~plist.base, append_#in~plist.offset;append_#t~post2 := ~c~0;~c~0 := 1 + append_#t~post2;havoc append_#t~post2;call append_#t~malloc3.base, append_#t~malloc3.offset := #Ultimate.allocOnHeap(8);append_~item~0.base, append_~item~0.offset := append_#t~malloc3.base, append_#t~malloc3.offset;call append_#t~mem4.base, append_#t~mem4.offset := read~$Pointer$(append_~plist.base, append_~plist.offset, 4);call write~$Pointer$(append_#t~mem4.base, append_#t~mem4.offset, append_~item~0.base, append_~item~0.offset, 4);havoc append_#t~mem4.base, append_#t~mem4.offset;call append_#t~mem5.base, append_#t~mem5.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4); 338#L523 assume append_#t~mem5.base != 0 || append_#t~mem5.offset != 0;call append_#t~mem6.base, append_#t~mem6.offset := read~$Pointer$(append_~item~0.base, append_~item~0.offset, 4);call append_#t~mem7.base, append_#t~mem7.offset := read~$Pointer$(append_#t~mem6.base, 4 + append_#t~mem6.offset, 4);append_#t~ite9.base, append_#t~ite9.offset := append_#t~mem7.base, append_#t~mem7.offset; 327#L523-2 call write~$Pointer$(append_#t~ite9.base, append_#t~ite9.offset, append_~item~0.base, 4 + append_~item~0.offset, 4);havoc append_#t~mem7.base, append_#t~mem7.offset;havoc append_#t~mem5.base, append_#t~mem5.offset;havoc append_#t~mem6.base, append_#t~mem6.offset;havoc append_#t~ite9.base, append_#t~ite9.offset;call write~$Pointer$(append_~item~0.base, append_~item~0.offset, append_~plist.base, append_~plist.offset, 4); 328#L518 main_#t~post11 := main_~length~0;main_~length~0 := 1 + main_#t~post11;havoc main_#t~post11; 332#L532-1 assume !(0 != main_#t~nondet10 && ~c~0 < 20);havoc main_#t~nondet10; 333#L532-4 assume main_~length~0 > 0;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset, 4);main_~next~0.base, main_~next~0.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_#t~mem14.base, 4 + main_#t~mem14.offset, 4);call ULTIMATE.dealloc(main_#t~mem15.base, main_#t~mem15.offset);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~mem14.base, main_#t~mem14.offset;call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem16.base, main_#t~mem16.offset);havoc main_#t~mem16.base, main_#t~mem16.offset;call write~$Pointer$(main_~next~0.base, main_~next~0.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post17 := main_~length~0;main_~length~0 := main_#t~post17 - 1;havoc main_#t~post17; 331#L543-1 [2019-11-25 08:58:40,981 INFO L796 eck$LassoCheckResult]: Loop: 331#L543-1 assume !!(main_~length~0 > 0);call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_#t~mem18.base, main_#t~mem18.offset, 4);main_~next~1.base, main_~next~1.offset := main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem18.base, main_#t~mem18.offset;call main_#t~mem20.base, main_#t~mem20.offset := read~$Pointer$(main_~#list~0.base, main_~#list~0.offset, 4);call ULTIMATE.dealloc(main_#t~mem20.base, main_#t~mem20.offset);havoc main_#t~mem20.base, main_#t~mem20.offset;call write~$Pointer$(main_~next~1.base, main_~next~1.offset, main_~#list~0.base, main_~#list~0.offset, 4);main_#t~post21 := main_~length~0;main_~length~0 := main_#t~post21 - 1;havoc main_#t~post21; 331#L543-1 [2019-11-25 08:58:40,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:40,981 INFO L82 PathProgramCache]: Analyzing trace with hash -317371272, now seen corresponding path program 1 times [2019-11-25 08:58:40,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:40,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674291079] [2019-11-25 08:58:40,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:41,047 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:41,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:41,047 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 4 times [2019-11-25 08:58:41,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:41,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743628503] [2019-11-25 08:58:41,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:41,055 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:41,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:41,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1248574802, now seen corresponding path program 1 times [2019-11-25 08:58:41,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:41,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310126223] [2019-11-25 08:58:41,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:58:41,147 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:58:45,789 WARN L192 SmtUtils]: Spent 4.52 s on a formula simplification. DAG size of input: 321 DAG size of output: 244 [2019-11-25 08:58:46,418 WARN L192 SmtUtils]: Spent 613.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2019-11-25 08:58:46,420 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:58:46,420 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:58:46,420 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:58:46,421 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:58:46,421 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:58:46,421 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:58:46,421 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:58:46,421 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:58:46,421 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-0232_1-2.i_Iteration6_Lasso [2019-11-25 08:58:46,421 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:58:46,421 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:58:46,426 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-25 08:58:46,436 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-25 08:58:46,438 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-25 08:58:46,440 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-25 08:58:46,443 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-25 08:58:46,445 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-25 08:58:46,448 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-25 08:58:46,452 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-25 08:58:46,454 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-25 08:58:46,456 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-25 08:58:46,458 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-25 08:58:46,461 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-25 08:58:46,463 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-25 08:58:46,465 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-25 08:58:46,466 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-25 08:58:46,468 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-25 08:58:46,471 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-25 08:58:46,473 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-25 08:58:46,475 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-25 08:58:46,482 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-25 08:58:46,763 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-25 08:58:46,766 INFO L168 Benchmark]: Toolchain (without parser) took 21423.69 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.0 MB). Free memory was 940.7 MB in the beginning and 1.2 GB in the end (delta: -258.8 MB). Peak memory consumption was 407.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:46,766 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:58:46,767 INFO L168 Benchmark]: CACSL2BoogieTranslator took 520.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:46,767 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.06 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:46,767 INFO L168 Benchmark]: Boogie Preprocessor took 28.17 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-25 08:58:46,771 INFO L168 Benchmark]: RCFGBuilder took 477.74 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:46,771 INFO L168 Benchmark]: BuchiAutomizer took 20338.14 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -105.6 MB). Peak memory consumption was 420.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:46,773 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 520.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.06 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.17 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 477.74 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 20338.14 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -105.6 MB). Peak memory consumption was 420.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...