./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/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 bbb28681f649db641abcf0a1b656085d04f9cc91 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 00:51:30,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:51:30,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:51:30,575 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:51:30,576 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:51:30,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:51:30,584 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:51:30,595 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:51:30,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:51:30,604 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:51:30,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:51:30,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:51:30,608 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:51:30,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:51:30,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:51:30,616 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:51:30,624 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:51:30,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:51:30,632 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:51:30,642 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:51:30,644 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:51:30,645 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:51:30,647 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:51:30,649 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:51:30,658 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:51:30,658 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:51:30,659 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:51:30,661 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:51:30,662 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:51:30,663 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:51:30,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:51:30,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:51:30,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:51:30,669 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:51:30,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:51:30,671 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:51:30,672 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:51:30,672 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:51:30,672 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:51:30,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:51:30,674 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:51:30,678 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-30 00:51:30,729 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:51:30,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:51:30,731 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:51:30,731 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:51:30,731 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:51:30,732 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-30 00:51:30,732 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-30 00:51:30,732 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-30 00:51:30,732 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-30 00:51:30,732 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-30 00:51:30,733 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-30 00:51:30,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:51:30,733 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:51:30,733 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 00:51:30,733 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:51:30,734 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:51:30,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:51:30,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-30 00:51:30,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-30 00:51:30,734 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-30 00:51:30,735 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:51:30,735 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 00:51:30,735 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-30 00:51:30,735 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:51:30,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-30 00:51:30,736 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:51:30,736 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:51:30,736 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-30 00:51:30,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:51:30,737 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:51:30,737 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:51:30,737 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-30 00:51:30,738 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-30 00:51:30,738 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_6d51c432-0b56-46ce-988f-a766bac88b53/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 -> bbb28681f649db641abcf0a1b656085d04f9cc91 [2020-11-30 00:51:30,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:51:31,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:51:31,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:51:31,029 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:51:31,029 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:51:31,031 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i [2020-11-30 00:51:31,105 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/data/a756d6f88/ca0a228d70744a9792972a8f85e2f61d/FLAG66f84006b [2020-11-30 00:51:31,675 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:51:31,677 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i [2020-11-30 00:51:31,703 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/data/a756d6f88/ca0a228d70744a9792972a8f85e2f61d/FLAG66f84006b [2020-11-30 00:51:31,991 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/data/a756d6f88/ca0a228d70744a9792972a8f85e2f61d [2020-11-30 00:51:31,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:51:31,995 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 00:51:31,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:51:31,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:51:32,002 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:51:32,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:51:31" (1/1) ... [2020-11-30 00:51:32,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f1f42aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:51:32, skipping insertion in model container [2020-11-30 00:51:32,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:51:31" (1/1) ... [2020-11-30 00:51:32,013 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:51:32,075 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:51:32,410 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:51:32,427 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:51:32,482 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:51:32,552 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:51:32,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:51:32 WrapperNode [2020-11-30 00:51:32,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:51:32,554 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 00:51:32,555 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 00:51:32,555 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 00:51:32,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:51:32" (1/1) ... [2020-11-30 00:51:32,579 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:51:32" (1/1) ... [2020-11-30 00:51:32,605 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 00:51:32,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:51:32,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:51:32,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:51:32,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:51:32" (1/1) ... [2020-11-30 00:51:32,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:51:32" (1/1) ... [2020-11-30 00:51:32,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:51:32" (1/1) ... [2020-11-30 00:51:32,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:51:32" (1/1) ... [2020-11-30 00:51:32,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:51:32" (1/1) ... [2020-11-30 00:51:32,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:51:32" (1/1) ... [2020-11-30 00:51:32,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:51:32" (1/1) ... [2020-11-30 00:51:32,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:51:32,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:51:32,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:51:32,694 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:51:32,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:51:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/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 [2020-11-30 00:51:32,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-30 00:51:32,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 00:51:32,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:51:32,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 00:51:32,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:51:32,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:51:33,310 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:51:33,311 INFO L298 CfgBuilder]: Removed 16 assume(true) statements. [2020-11-30 00:51:33,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:51:33 BoogieIcfgContainer [2020-11-30 00:51:33,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:51:33,314 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-30 00:51:33,315 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-30 00:51:33,330 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-30 00:51:33,331 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:51:33,332 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 30.11 12:51:31" (1/3) ... [2020-11-30 00:51:33,333 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6efb6626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 12:51:33, skipping insertion in model container [2020-11-30 00:51:33,334 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:51:33,334 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:51:32" (2/3) ... [2020-11-30 00:51:33,335 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6efb6626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 12:51:33, skipping insertion in model container [2020-11-30 00:51:33,335 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:51:33,335 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:51:33" (3/3) ... [2020-11-30 00:51:33,337 INFO L373 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrstr-alloca-2.i [2020-11-30 00:51:33,385 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-30 00:51:33,386 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-30 00:51:33,386 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-30 00:51:33,386 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:51:33,386 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:51:33,387 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-30 00:51:33,387 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:51:33,387 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-30 00:51:33,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2020-11-30 00:51:33,423 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2020-11-30 00:51:33,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:51:33,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:51:33,432 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-11-30 00:51:33,432 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-30 00:51:33,432 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-30 00:51:33,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2020-11-30 00:51:33,436 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2020-11-30 00:51:33,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:51:33,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:51:33,437 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-11-30 00:51:33,437 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-30 00:51:33,445 INFO L794 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 4#L555true assume !(main_~length1~0 < 1); 28#L555-2true assume !(main_~length2~0 < 1); 19#L558-1true call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 35#L564-3true [2020-11-30 00:51:33,445 INFO L796 eck$LassoCheckResult]: Loop: 35#L564-3true assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 32#L564-2true main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 35#L564-3true [2020-11-30 00:51:33,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:33,452 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-11-30 00:51:33,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:33,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681556364] [2020-11-30 00:51:33,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:33,589 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:33,609 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:33,636 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:51:33,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:33,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2020-11-30 00:51:33,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:33,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226518902] [2020-11-30 00:51:33,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:33,652 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:33,661 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:33,665 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:51:33,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:33,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2020-11-30 00:51:33,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:33,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775216478] [2020-11-30 00:51:33,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:33,702 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:33,726 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:33,733 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:51:34,046 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2020-11-30 00:51:34,217 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-11-30 00:51:34,231 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:51:34,232 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:51:34,233 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:51:34,233 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:51:34,233 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:51:34,233 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:34,233 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:51:34,234 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:51:34,234 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration1_Lasso [2020-11-30 00:51:34,234 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:51:34,234 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:51:34,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:34,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:34,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:34,718 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2020-11-30 00:51:34,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:34,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:34,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:34,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:34,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:34,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:34,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:34,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:34,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:34,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:34,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:34,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:34,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:35,316 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:51:35,322 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/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) [2020-11-30 00:51:35,336 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 [2020-11-30 00:51:35,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:35,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:35,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:35,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:35,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:35,344 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:35,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:35,352 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/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) [2020-11-30 00:51:35,403 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 [2020-11-30 00:51:35,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:35,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:35,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:35,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:35,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:35,410 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:35,411 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 [2020-11-30 00:51:35,414 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/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) [2020-11-30 00:51:35,464 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 [2020-11-30 00:51:35,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:35,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:35,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:35,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:35,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:51:35,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:35,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_6d51c432-0b56-46ce-988f-a766bac88b53/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) [2020-11-30 00:51:35,558 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 [2020-11-30 00:51:35,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:35,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:35,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:35,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:35,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:35,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:35,563 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:35,565 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/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 [2020-11-30 00:51:35,599 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 [2020-11-30 00:51:35,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:35,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:35,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:35,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:35,617 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:51:35,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:51:35,635 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:51:35,707 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-11-30 00:51:35,708 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:35,718 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-30 00:51:35,723 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-30 00:51:35,723 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:51:35,724 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-11-30 00:51:35,793 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-11-30 00:51:35,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:35,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:51:35,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:51:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:35,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:51:35,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:51:35,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:51:35,936 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-30 00:51:35,938 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states. Second operand 3 states. [2020-11-30 00:51:36,042 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states.. Second operand 3 states. Result 99 states and 145 transitions. Complement of second has 7 states. [2020-11-30 00:51:36,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-30 00:51:36,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 00:51:36,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2020-11-30 00:51:36,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 5 letters. Loop has 2 letters. [2020-11-30 00:51:36,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:51:36,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 7 letters. Loop has 2 letters. [2020-11-30 00:51:36,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:51:36,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 5 letters. Loop has 4 letters. [2020-11-30 00:51:36,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:51:36,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 145 transitions. [2020-11-30 00:51:36,061 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2020-11-30 00:51:36,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 32 states and 43 transitions. [2020-11-30 00:51:36,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-11-30 00:51:36,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-11-30 00:51:36,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 43 transitions. [2020-11-30 00:51:36,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:51:36,070 INFO L691 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2020-11-30 00:51:36,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 43 transitions. [2020-11-30 00:51:36,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-11-30 00:51:36,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-11-30 00:51:36,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2020-11-30 00:51:36,164 INFO L714 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2020-11-30 00:51:36,164 INFO L594 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2020-11-30 00:51:36,164 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-30 00:51:36,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2020-11-30 00:51:36,165 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2020-11-30 00:51:36,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:51:36,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:51:36,166 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:51:36,166 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-30 00:51:36,166 INFO L794 eck$LassoCheckResult]: Stem: 235#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 217#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 210#L555 assume !(main_~length1~0 < 1); 211#L555-2 assume !(main_~length2~0 < 1); 227#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 228#L564-3 assume !(main_~i~0 < main_~length1~0); 239#L564-4 main_~i~1 := 0; 209#L568-3 [2020-11-30 00:51:36,166 INFO L796 eck$LassoCheckResult]: Loop: 209#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 208#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 209#L568-3 [2020-11-30 00:51:36,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:36,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2020-11-30 00:51:36,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:36,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872241127] [2020-11-30 00:51:36,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:36,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:51:36,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872241127] [2020-11-30 00:51:36,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:51:36,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:51:36,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793971143] [2020-11-30 00:51:36,276 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:51:36,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:36,276 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2020-11-30 00:51:36,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:36,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606723342] [2020-11-30 00:51:36,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:36,299 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:36,306 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:36,309 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:51:36,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:51:36,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:51:36,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:51:36,377 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. cyclomatic complexity: 15 Second operand 4 states. [2020-11-30 00:51:36,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:51:36,425 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2020-11-30 00:51:36,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:51:36,428 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2020-11-30 00:51:36,430 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2020-11-30 00:51:36,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 43 transitions. [2020-11-30 00:51:36,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-11-30 00:51:36,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-11-30 00:51:36,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2020-11-30 00:51:36,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:51:36,432 INFO L691 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2020-11-30 00:51:36,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2020-11-30 00:51:36,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2020-11-30 00:51:36,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-11-30 00:51:36,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2020-11-30 00:51:36,442 INFO L714 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2020-11-30 00:51:36,442 INFO L594 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2020-11-30 00:51:36,442 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-30 00:51:36,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2020-11-30 00:51:36,446 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2020-11-30 00:51:36,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:51:36,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:51:36,447 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:51:36,447 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-30 00:51:36,447 INFO L794 eck$LassoCheckResult]: Stem: 307#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 289#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 282#L555 assume !(main_~length1~0 < 1); 283#L555-2 assume !(main_~length2~0 < 1); 300#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 301#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 309#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 310#L564-3 assume !(main_~i~0 < main_~length1~0); 311#L564-4 main_~i~1 := 0; 281#L568-3 [2020-11-30 00:51:36,448 INFO L796 eck$LassoCheckResult]: Loop: 281#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 280#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 281#L568-3 [2020-11-30 00:51:36,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:36,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1298440016, now seen corresponding path program 1 times [2020-11-30 00:51:36,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:36,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192502461] [2020-11-30 00:51:36,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:36,481 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:36,509 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:36,517 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:51:36,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:36,526 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 2 times [2020-11-30 00:51:36,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:36,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559520409] [2020-11-30 00:51:36,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:36,540 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:36,546 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:36,552 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:51:36,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:36,554 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626574, now seen corresponding path program 1 times [2020-11-30 00:51:36,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:36,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762171988] [2020-11-30 00:51:36,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:36,600 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:36,637 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:36,643 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:51:37,018 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2020-11-30 00:51:37,195 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-11-30 00:51:37,199 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:51:37,199 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:51:37,199 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:51:37,200 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:51:37,200 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:51:37,200 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:37,200 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:51:37,200 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:51:37,200 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration3_Lasso [2020-11-30 00:51:37,200 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:51:37,200 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:51:37,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:37,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:37,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:37,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:37,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:37,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:37,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:37,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:37,536 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-11-30 00:51:37,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:37,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:37,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:37,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:37,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:37,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:37,880 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2020-11-30 00:51:38,190 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:51:38,191 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/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 [2020-11-30 00:51:38,197 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 [2020-11-30 00:51:38,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:38,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:38,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:38,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:38,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:38,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:38,200 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:51:38,201 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/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 [2020-11-30 00:51:38,229 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 [2020-11-30 00:51:38,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:38,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:38,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:38,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:38,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:38,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:38,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:51:38,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/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 [2020-11-30 00:51:38,273 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 [2020-11-30 00:51:38,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:38,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:38,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:38,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:38,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:38,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:38,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:51:38,276 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/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 [2020-11-30 00:51:38,304 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 [2020-11-30 00:51:38,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:38,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:38,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:38,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:38,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:38,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:38,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:51:38,317 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/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) [2020-11-30 00:51:38,344 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 [2020-11-30 00:51:38,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:38,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:38,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:38,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:38,350 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:51:38,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:51:38,359 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/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) [2020-11-30 00:51:38,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:51:38,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:38,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:38,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:38,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:38,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:38,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:38,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:38,421 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/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 [2020-11-30 00:51:38,453 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 [2020-11-30 00:51:38,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:38,455 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:38,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:38,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:38,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:38,456 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:38,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:51:38,457 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/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 [2020-11-30 00:51:38,486 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 [2020-11-30 00:51:38,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:38,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:38,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:38,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:38,500 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:51:38,500 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:51:38,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_6d51c432-0b56-46ce-988f-a766bac88b53/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) [2020-11-30 00:51:38,562 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 [2020-11-30 00:51:38,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:38,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:38,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:38,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:38,578 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:51:38,582 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:38,598 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/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) [2020-11-30 00:51:38,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:38,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:38,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:38,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:38,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:38,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:38,644 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:38,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:51:38,646 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/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 [2020-11-30 00:51:38,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:51:38,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:38,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:38,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:38,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:38,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:38,676 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:38,676 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:51:38,679 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/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 [2020-11-30 00:51:38,711 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 [2020-11-30 00:51:38,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:38,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:38,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:38,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:38,717 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:51:38,717 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:51:38,747 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/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) [2020-11-30 00:51:38,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:51:38,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:38,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:38,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:38,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:38,810 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:51:38,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:38,818 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/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) [2020-11-30 00:51:38,867 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 [2020-11-30 00:51:38,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:38,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:38,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:38,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:38,919 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:51:38,919 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:51:38,943 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:51:38,989 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-11-30 00:51:38,989 INFO L444 ModelExtractionUtils]: 20 out of 37 variables were initially zero. Simplification set additionally 14 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:51:38,997 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:39,004 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-30 00:51:39,004 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:51:39,004 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~length2~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~length2~0 Supporting invariants [] [2020-11-30 00:51:39,088 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2020-11-30 00:51:39,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:39,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:51:39,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:51:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:39,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:51:39,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:51:39,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:51:39,199 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-30 00:51:39,199 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 14 Second operand 3 states. [2020-11-30 00:51:39,241 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 55 states and 75 transitions. Complement of second has 6 states. [2020-11-30 00:51:39,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-30 00:51:39,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 00:51:39,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2020-11-30 00:51:39,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 9 letters. Loop has 2 letters. [2020-11-30 00:51:39,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:51:39,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 11 letters. Loop has 2 letters. [2020-11-30 00:51:39,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:51:39,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 9 letters. Loop has 4 letters. [2020-11-30 00:51:39,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:51:39,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 75 transitions. [2020-11-30 00:51:39,260 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-11-30 00:51:39,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 33 states and 44 transitions. [2020-11-30 00:51:39,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-11-30 00:51:39,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-11-30 00:51:39,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2020-11-30 00:51:39,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:51:39,266 INFO L691 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2020-11-30 00:51:39,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2020-11-30 00:51:39,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-11-30 00:51:39,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-11-30 00:51:39,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2020-11-30 00:51:39,273 INFO L714 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2020-11-30 00:51:39,273 INFO L594 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2020-11-30 00:51:39,273 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-30 00:51:39,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 44 transitions. [2020-11-30 00:51:39,274 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-11-30 00:51:39,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:51:39,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:51:39,275 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:51:39,275 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:51:39,275 INFO L794 eck$LassoCheckResult]: Stem: 487#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 469#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 461#L555 assume !(main_~length1~0 < 1); 462#L555-2 assume !(main_~length2~0 < 1); 479#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 480#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 489#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 490#L564-3 assume !(main_~i~0 < main_~length1~0); 491#L564-4 main_~i~1 := 0; 465#L568-3 assume !(main_~i~1 < main_~length2~0); 466#L568-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 486#L540 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 477#L518-4 [2020-11-30 00:51:39,276 INFO L796 eck$LassoCheckResult]: Loop: 477#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 482#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 476#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 477#L518-4 [2020-11-30 00:51:39,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:39,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1351083894, now seen corresponding path program 1 times [2020-11-30 00:51:39,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:39,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119850751] [2020-11-30 00:51:39,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:51:39,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119850751] [2020-11-30 00:51:39,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:51:39,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:51:39,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278389029] [2020-11-30 00:51:39,332 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:51:39,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:39,333 INFO L82 PathProgramCache]: Analyzing trace with hash 79603, now seen corresponding path program 1 times [2020-11-30 00:51:39,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:39,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318938938] [2020-11-30 00:51:39,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:39,340 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:39,347 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:39,356 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:51:39,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:51:39,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:51:39,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:51:39,407 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. cyclomatic complexity: 15 Second operand 4 states. [2020-11-30 00:51:39,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:51:39,450 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2020-11-30 00:51:39,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:51:39,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 44 transitions. [2020-11-30 00:51:39,457 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-11-30 00:51:39,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 44 transitions. [2020-11-30 00:51:39,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-11-30 00:51:39,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-11-30 00:51:39,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2020-11-30 00:51:39,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:51:39,458 INFO L691 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2020-11-30 00:51:39,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2020-11-30 00:51:39,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-11-30 00:51:39,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-11-30 00:51:39,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2020-11-30 00:51:39,460 INFO L714 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2020-11-30 00:51:39,460 INFO L594 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2020-11-30 00:51:39,460 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-30 00:51:39,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2020-11-30 00:51:39,461 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-11-30 00:51:39,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:51:39,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:51:39,462 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:51:39,462 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:51:39,462 INFO L794 eck$LassoCheckResult]: Stem: 561#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 543#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 535#L555 assume !(main_~length1~0 < 1); 536#L555-2 assume !(main_~length2~0 < 1); 554#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 555#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 563#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 564#L564-3 assume !(main_~i~0 < main_~length1~0); 565#L564-4 main_~i~1 := 0; 541#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 533#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 534#L568-3 assume !(main_~i~1 < main_~length2~0); 542#L568-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 560#L540 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 551#L518-4 [2020-11-30 00:51:39,462 INFO L796 eck$LassoCheckResult]: Loop: 551#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 556#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 550#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 551#L518-4 [2020-11-30 00:51:39,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:39,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1313217428, now seen corresponding path program 1 times [2020-11-30 00:51:39,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:39,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886358713] [2020-11-30 00:51:39,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:39,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:51:39,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886358713] [2020-11-30 00:51:39,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524501718] [2020-11-30 00:51:39,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:51:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:39,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 21 conjunts are in the unsatisfiable core [2020-11-30 00:51:39,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:51:40,178 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2020-11-30 00:51:40,195 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:51:40,196 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2020-11-30 00:51:40,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:51:40,212 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:51:40,214 INFO L441 ElimStorePlain]: Different costs {0=[v_arrayElimCell_2], 1=[v_arrayElimCell_1]} [2020-11-30 00:51:40,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:51:40,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:51:40,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2020-11-30 00:51:40,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90234439] [2020-11-30 00:51:40,269 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:51:40,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:40,269 INFO L82 PathProgramCache]: Analyzing trace with hash 79603, now seen corresponding path program 2 times [2020-11-30 00:51:40,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:40,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919316095] [2020-11-30 00:51:40,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:40,276 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:40,280 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:40,282 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:51:40,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:51:40,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-30 00:51:40,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-11-30 00:51:40,367 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand 12 states. [2020-11-30 00:51:40,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:51:40,664 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2020-11-30 00:51:40,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:51:40,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2020-11-30 00:51:40,668 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-11-30 00:51:40,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 36 states and 46 transitions. [2020-11-30 00:51:40,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-11-30 00:51:40,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-11-30 00:51:40,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2020-11-30 00:51:40,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:51:40,669 INFO L691 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2020-11-30 00:51:40,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2020-11-30 00:51:40,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-11-30 00:51:40,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-11-30 00:51:40,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2020-11-30 00:51:40,673 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-11-30 00:51:40,673 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-11-30 00:51:40,673 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-30 00:51:40,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2020-11-30 00:51:40,674 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-11-30 00:51:40,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:51:40,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:51:40,676 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:51:40,677 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:51:40,677 INFO L794 eck$LassoCheckResult]: Stem: 695#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 676#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 668#L555 assume !(main_~length1~0 < 1); 669#L555-2 assume !(main_~length2~0 < 1); 687#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 688#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 697#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 698#L564-3 assume !(main_~i~0 < main_~length1~0); 699#L564-4 main_~i~1 := 0; 672#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 666#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 667#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 673#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 700#L568-3 assume !(main_~i~1 < main_~length2~0); 693#L568-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 694#L540 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 684#L518-4 [2020-11-30 00:51:40,678 INFO L796 eck$LassoCheckResult]: Loop: 684#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 689#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 683#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 684#L518-4 [2020-11-30 00:51:40,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:40,678 INFO L82 PathProgramCache]: Analyzing trace with hash -716718030, now seen corresponding path program 2 times [2020-11-30 00:51:40,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:40,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751512891] [2020-11-30 00:51:40,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:40,729 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:40,765 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:40,784 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:51:40,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:40,786 INFO L82 PathProgramCache]: Analyzing trace with hash 79603, now seen corresponding path program 3 times [2020-11-30 00:51:40,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:40,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829643398] [2020-11-30 00:51:40,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:40,791 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:40,794 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:40,796 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:51:40,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:40,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1464353502, now seen corresponding path program 1 times [2020-11-30 00:51:40,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:40,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607899781] [2020-11-30 00:51:40,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:41,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:51:41,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607899781] [2020-11-30 00:51:41,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899619577] [2020-11-30 00:51:41,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:51:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:41,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 38 conjunts are in the unsatisfiable core [2020-11-30 00:51:41,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:51:41,749 INFO L350 Elim1Store]: treesize reduction 40, result has 20.0 percent of original size [2020-11-30 00:51:41,750 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 21 [2020-11-30 00:51:41,750 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:51:41,772 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:51:41,776 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-11-30 00:51:41,777 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:54, output treesize:38 [2020-11-30 00:51:41,969 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 00:51:41,972 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:51:41,973 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 10 [2020-11-30 00:51:41,974 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:51:42,001 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:51:42,011 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:51:42,011 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:35, output treesize:3 [2020-11-30 00:51:42,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:51:42,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:51:42,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2020-11-30 00:51:42,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336256417] [2020-11-30 00:51:42,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:51:42,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-30 00:51:42,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2020-11-30 00:51:42,060 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. cyclomatic complexity: 14 Second operand 22 states. [2020-11-30 00:51:43,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:51:43,347 INFO L93 Difference]: Finished difference Result 111 states and 141 transitions. [2020-11-30 00:51:43,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-30 00:51:43,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 141 transitions. [2020-11-30 00:51:43,351 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 62 [2020-11-30 00:51:43,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 111 states and 141 transitions. [2020-11-30 00:51:43,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2020-11-30 00:51:43,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2020-11-30 00:51:43,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 141 transitions. [2020-11-30 00:51:43,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:51:43,362 INFO L691 BuchiCegarLoop]: Abstraction has 111 states and 141 transitions. [2020-11-30 00:51:43,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 141 transitions. [2020-11-30 00:51:43,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 41. [2020-11-30 00:51:43,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-11-30 00:51:43,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2020-11-30 00:51:43,375 INFO L714 BuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2020-11-30 00:51:43,375 INFO L594 BuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2020-11-30 00:51:43,375 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-30 00:51:43,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 52 transitions. [2020-11-30 00:51:43,376 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-11-30 00:51:43,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:51:43,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:51:43,378 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:51:43,378 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:51:43,381 INFO L794 eck$LassoCheckResult]: Stem: 959#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 939#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 931#L555 assume !(main_~length1~0 < 1); 932#L555-2 assume !(main_~length2~0 < 1); 948#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 949#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 961#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 962#L564-3 assume !(main_~i~0 < main_~length1~0); 963#L564-4 main_~i~1 := 0; 935#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 929#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 930#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 936#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 969#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 968#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 967#L568-3 assume !(main_~i~1 < main_~length2~0); 966#L568-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 965#L540 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 947#L518-4 [2020-11-30 00:51:43,381 INFO L796 eck$LassoCheckResult]: Loop: 947#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 964#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 946#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 947#L518-4 [2020-11-30 00:51:43,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:43,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1569540784, now seen corresponding path program 3 times [2020-11-30 00:51:43,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:43,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222394076] [2020-11-30 00:51:43,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:43,420 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:43,446 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:43,463 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:51:43,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:43,467 INFO L82 PathProgramCache]: Analyzing trace with hash 79603, now seen corresponding path program 4 times [2020-11-30 00:51:43,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:43,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994213270] [2020-11-30 00:51:43,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:43,476 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:43,479 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:43,481 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:51:43,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:43,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1119505220, now seen corresponding path program 2 times [2020-11-30 00:51:43,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:43,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172525804] [2020-11-30 00:51:43,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:43,524 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:43,562 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:43,572 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:51:45,528 WARN L193 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 190 DAG size of output: 156 [2020-11-30 00:51:46,114 WARN L193 SmtUtils]: Spent 562.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-11-30 00:51:46,118 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:51:46,118 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:51:46,118 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:51:46,118 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:51:46,119 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:51:46,119 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:46,119 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:51:46,119 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:51:46,119 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration7_Lasso [2020-11-30 00:51:46,119 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:51:46,119 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:51:46,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:46,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:46,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:46,851 WARN L193 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 94 [2020-11-30 00:51:46,999 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2020-11-30 00:51:46,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:47,385 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2020-11-30 00:51:47,776 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-11-30 00:51:48,041 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:51:48,041 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:48,051 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 [2020-11-30 00:51:48,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:48,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:48,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:48,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:48,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:48,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:48,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:51:48,055 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:48,085 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 [2020-11-30 00:51:48,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:48,087 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:48,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:48,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:48,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:48,087 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:48,087 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:51:48,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:48,122 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 [2020-11-30 00:51:48,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:48,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:48,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:48,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:48,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:51:48,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:51:48,129 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:48,157 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 [2020-11-30 00:51:48,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:48,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:48,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:48,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:48,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:51:48,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:51:48,219 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:51:48,271 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-11-30 00:51:48,271 INFO L444 ModelExtractionUtils]: 47 out of 61 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:51:48,275 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:48,278 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-30 00:51:48,278 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:51:48,278 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_3, ULTIMATE.start_cstrlen_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_3 - 1*ULTIMATE.start_cstrlen_~s~0.offset Supporting invariants [] [2020-11-30 00:51:48,417 INFO L297 tatePredicateManager]: 21 out of 22 supporting invariants were superfluous and have been removed [2020-11-30 00:51:48,420 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-30 00:51:48,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:48,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjunts are in the unsatisfiable core [2020-11-30 00:51:48,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:51:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:48,532 WARN L261 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 00:51:48,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:51:48,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:51:48,551 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2020-11-30 00:51:48,551 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 52 transitions. cyclomatic complexity: 15 Second operand 5 states. [2020-11-30 00:51:48,681 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 52 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 61 states and 80 transitions. Complement of second has 6 states. [2020-11-30 00:51:48,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-30 00:51:48,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-11-30 00:51:48,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-11-30 00:51:48,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 18 letters. Loop has 3 letters. [2020-11-30 00:51:48,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:51:48,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 21 letters. Loop has 3 letters. [2020-11-30 00:51:48,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:51:48,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 18 letters. Loop has 6 letters. [2020-11-30 00:51:48,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:51:48,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 80 transitions. [2020-11-30 00:51:48,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-11-30 00:51:48,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 43 states and 55 transitions. [2020-11-30 00:51:48,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-11-30 00:51:48,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2020-11-30 00:51:48,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 55 transitions. [2020-11-30 00:51:48,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:51:48,689 INFO L691 BuchiCegarLoop]: Abstraction has 43 states and 55 transitions. [2020-11-30 00:51:48,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 55 transitions. [2020-11-30 00:51:48,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2020-11-30 00:51:48,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-30 00:51:48,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2020-11-30 00:51:48,693 INFO L714 BuchiCegarLoop]: Abstraction has 42 states and 54 transitions. [2020-11-30 00:51:48,694 INFO L594 BuchiCegarLoop]: Abstraction has 42 states and 54 transitions. [2020-11-30 00:51:48,694 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-30 00:51:48,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 54 transitions. [2020-11-30 00:51:48,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-11-30 00:51:48,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:51:48,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:51:48,696 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:51:48,696 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:51:48,697 INFO L794 eck$LassoCheckResult]: Stem: 1245#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1224#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 1216#L555 assume !(main_~length1~0 < 1); 1217#L555-2 assume !(main_~length2~0 < 1); 1235#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 1236#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 1247#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 1248#L564-3 assume !(main_~i~0 < main_~length1~0); 1249#L564-4 main_~i~1 := 0; 1220#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 1214#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 1215#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 1221#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 1255#L568-3 assume !(main_~i~1 < main_~length2~0); 1243#L568-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 1244#L540 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 1237#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1238#L518-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1240#L518-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 1241#L520 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 1246#L542-4 [2020-11-30 00:51:48,697 INFO L796 eck$LassoCheckResult]: Loop: 1246#L542-4 goto; 1225#L543-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 1218#L544 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 1219#L543 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 1242#L542-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 1233#L525 assume 0 == cstrncmp_~n % 4294967296;cstrncmp_#res := 0; 1222#L533 cstrstr_#t~ret16 := cstrncmp_#res; 1223#L542-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 1246#L542-4 [2020-11-30 00:51:48,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:48,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1849679959, now seen corresponding path program 1 times [2020-11-30 00:51:48,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:48,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182358849] [2020-11-30 00:51:48,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:48,715 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:48,731 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:48,738 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:51:48,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:48,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1079765744, now seen corresponding path program 1 times [2020-11-30 00:51:48,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:48,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539559152] [2020-11-30 00:51:48,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:48,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:51:48,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539559152] [2020-11-30 00:51:48,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:51:48,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:51:48,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682901034] [2020-11-30 00:51:48,773 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 00:51:48,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:51:48,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:51:48,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:51:48,774 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. cyclomatic complexity: 16 Second operand 4 states. [2020-11-30 00:51:48,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:51:48,801 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2020-11-30 00:51:48,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:51:48,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 55 transitions. [2020-11-30 00:51:48,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-11-30 00:51:48,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 41 states and 50 transitions. [2020-11-30 00:51:48,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-11-30 00:51:48,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-11-30 00:51:48,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 50 transitions. [2020-11-30 00:51:48,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:51:48,803 INFO L691 BuchiCegarLoop]: Abstraction has 41 states and 50 transitions. [2020-11-30 00:51:48,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 50 transitions. [2020-11-30 00:51:48,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-11-30 00:51:48,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-11-30 00:51:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2020-11-30 00:51:48,807 INFO L714 BuchiCegarLoop]: Abstraction has 41 states and 50 transitions. [2020-11-30 00:51:48,807 INFO L594 BuchiCegarLoop]: Abstraction has 41 states and 50 transitions. [2020-11-30 00:51:48,807 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-30 00:51:48,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 50 transitions. [2020-11-30 00:51:48,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-11-30 00:51:48,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:51:48,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:51:48,809 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:51:48,809 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:51:48,810 INFO L794 eck$LassoCheckResult]: Stem: 1340#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1320#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 1311#L555 assume !(main_~length1~0 < 1); 1312#L555-2 assume !(main_~length2~0 < 1); 1330#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 1331#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 1342#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 1343#L564-3 assume !(main_~i~0 < main_~length1~0); 1345#L564-4 main_~i~1 := 0; 1315#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 1316#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 1317#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 1309#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 1310#L568-3 assume !(main_~i~1 < main_~length2~0); 1347#L568-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 1344#L540 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 1332#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1333#L518-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1335#L518-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 1336#L520 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 1341#L542-4 [2020-11-30 00:51:48,810 INFO L796 eck$LassoCheckResult]: Loop: 1341#L542-4 goto; 1321#L543-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 1313#L544 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 1314#L543 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 1337#L542-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 1328#L525 assume !(0 == cstrncmp_~n % 4294967296); 1329#L527-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 1324#L528 assume cstrncmp_#t~mem6 != cstrncmp_#t~mem7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;call cstrncmp_#t~mem9 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;call cstrncmp_#t~mem10 := read~int(cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, 1);cstrncmp_#res := cstrncmp_#t~mem9 % 256 - cstrncmp_#t~mem10 % 256;havoc cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset;havoc cstrncmp_#t~mem10;havoc cstrncmp_#t~mem9; 1318#L533 cstrstr_#t~ret16 := cstrncmp_#res; 1319#L542-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 1341#L542-4 [2020-11-30 00:51:48,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:48,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1849679959, now seen corresponding path program 2 times [2020-11-30 00:51:48,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:48,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306809708] [2020-11-30 00:51:48,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:48,846 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:48,866 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:48,879 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:51:48,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:48,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1728347221, now seen corresponding path program 1 times [2020-11-30 00:51:48,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:48,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627090994] [2020-11-30 00:51:48,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:48,903 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:48,923 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:48,929 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:51:48,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:48,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1941989675, now seen corresponding path program 1 times [2020-11-30 00:51:48,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:48,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260775783] [2020-11-30 00:51:48,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:49,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 00:51:49,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260775783] [2020-11-30 00:51:49,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695094428] [2020-11-30 00:51:49,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:51:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:49,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 27 conjunts are in the unsatisfiable core [2020-11-30 00:51:49,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:51:49,371 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_97|], 1=[|v_#valid_117|]} [2020-11-30 00:51:49,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:51:49,384 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-11-30 00:51:49,385 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:51:49,395 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:51:49,403 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-11-30 00:51:49,406 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:51:49,415 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:51:49,416 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:51:49,417 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2020-11-30 00:51:49,523 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 00:51:49,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:51:49,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2020-11-30 00:51:49,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449520691] [2020-11-30 00:51:49,975 WARN L193 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2020-11-30 00:51:50,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:51:50,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 00:51:50,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:51:50,053 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. cyclomatic complexity: 13 Second operand 11 states. [2020-11-30 00:51:50,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:51:50,219 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2020-11-30 00:51:50,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:51:50,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 85 transitions. [2020-11-30 00:51:50,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-11-30 00:51:50,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 44 states and 53 transitions. [2020-11-30 00:51:50,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-11-30 00:51:50,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-11-30 00:51:50,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 53 transitions. [2020-11-30 00:51:50,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:51:50,223 INFO L691 BuchiCegarLoop]: Abstraction has 44 states and 53 transitions. [2020-11-30 00:51:50,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 53 transitions. [2020-11-30 00:51:50,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2020-11-30 00:51:50,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-11-30 00:51:50,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2020-11-30 00:51:50,227 INFO L714 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2020-11-30 00:51:50,227 INFO L594 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2020-11-30 00:51:50,227 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-11-30 00:51:50,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 52 transitions. [2020-11-30 00:51:50,228 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-11-30 00:51:50,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:51:50,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:51:50,229 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:51:50,229 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:51:50,229 INFO L794 eck$LassoCheckResult]: Stem: 1563#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1543#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 1535#L555 assume !(main_~length1~0 < 1); 1536#L555-2 assume !(main_~length2~0 < 1); 1551#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 1552#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 1565#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 1566#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 1567#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 1569#L564-3 assume !(main_~i~0 < main_~length1~0); 1568#L564-4 main_~i~1 := 0; 1539#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 1533#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 1534#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 1540#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 1575#L568-3 assume !(main_~i~1 < main_~length2~0); 1561#L568-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 1562#L540 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 1555#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1556#L518-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1558#L518-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 1559#L520 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 1564#L542-4 [2020-11-30 00:51:50,229 INFO L796 eck$LassoCheckResult]: Loop: 1564#L542-4 goto; 1544#L543-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 1537#L544 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 1538#L543 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 1560#L542-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 1553#L525 assume !(0 == cstrncmp_~n % 4294967296); 1554#L527-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 1547#L528 assume cstrncmp_#t~mem6 != cstrncmp_#t~mem7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;call cstrncmp_#t~mem9 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;call cstrncmp_#t~mem10 := read~int(cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, 1);cstrncmp_#res := cstrncmp_#t~mem9 % 256 - cstrncmp_#t~mem10 % 256;havoc cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset;havoc cstrncmp_#t~mem10;havoc cstrncmp_#t~mem9; 1541#L533 cstrstr_#t~ret16 := cstrncmp_#res; 1542#L542-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 1564#L542-4 [2020-11-30 00:51:50,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:50,230 INFO L82 PathProgramCache]: Analyzing trace with hash 195946165, now seen corresponding path program 3 times [2020-11-30 00:51:50,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:50,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195246787] [2020-11-30 00:51:50,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:50,251 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:50,266 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:50,302 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:51:50,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:50,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1728347221, now seen corresponding path program 2 times [2020-11-30 00:51:50,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:50,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257290908] [2020-11-30 00:51:50,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:50,322 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:50,340 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:50,343 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:51:50,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:50,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1478979063, now seen corresponding path program 2 times [2020-11-30 00:51:50,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:50,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312419456] [2020-11-30 00:51:50,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:50,510 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-30 00:51:50,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312419456] [2020-11-30 00:51:50,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:51:50,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 00:51:50,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486231142] [2020-11-30 00:51:50,887 WARN L193 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2020-11-30 00:51:51,025 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-11-30 00:51:51,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:51:51,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:51:51,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:51:51,027 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 6 states. [2020-11-30 00:51:51,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:51:51,144 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2020-11-30 00:51:51,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:51:51,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 63 transitions. [2020-11-30 00:51:51,146 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2020-11-30 00:51:51,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 52 states and 61 transitions. [2020-11-30 00:51:51,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2020-11-30 00:51:51,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2020-11-30 00:51:51,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 61 transitions. [2020-11-30 00:51:51,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:51:51,147 INFO L691 BuchiCegarLoop]: Abstraction has 52 states and 61 transitions. [2020-11-30 00:51:51,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 61 transitions. [2020-11-30 00:51:51,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2020-11-30 00:51:51,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-11-30 00:51:51,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2020-11-30 00:51:51,154 INFO L714 BuchiCegarLoop]: Abstraction has 50 states and 59 transitions. [2020-11-30 00:51:51,154 INFO L594 BuchiCegarLoop]: Abstraction has 50 states and 59 transitions. [2020-11-30 00:51:51,154 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-11-30 00:51:51,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 59 transitions. [2020-11-30 00:51:51,155 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2020-11-30 00:51:51,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:51:51,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:51:51,156 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:51:51,156 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:51:51,157 INFO L794 eck$LassoCheckResult]: Stem: 1677#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1657#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 1649#L555 assume !(main_~length1~0 < 1); 1650#L555-2 assume !(main_~length2~0 < 1); 1665#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 1666#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 1680#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 1681#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 1683#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 1685#L564-3 assume !(main_~i~0 < main_~length1~0); 1684#L564-4 main_~i~1 := 0; 1653#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 1647#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 1648#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 1654#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 1691#L568-3 assume !(main_~i~1 < main_~length2~0); 1675#L568-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 1676#L540 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 1669#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1670#L518-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1673#L518-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 1674#L520 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 1678#L542-4 goto; 1658#L543-2 [2020-11-30 00:51:51,157 INFO L796 eck$LassoCheckResult]: Loop: 1658#L543-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 1651#L544 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 1652#L543 assume !!(cstrstr_~sc~0 != cstrstr_~c~0); 1658#L543-2 [2020-11-30 00:51:51,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:51,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1779363886, now seen corresponding path program 1 times [2020-11-30 00:51:51,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:51,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119185127] [2020-11-30 00:51:51,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:51,183 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:51,205 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:51,212 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:51:51,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:51,214 INFO L82 PathProgramCache]: Analyzing trace with hash 99467, now seen corresponding path program 1 times [2020-11-30 00:51:51,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:51,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259130724] [2020-11-30 00:51:51,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:51,221 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:51,224 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:51,227 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:51:51,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:51,228 INFO L82 PathProgramCache]: Analyzing trace with hash 543230270, now seen corresponding path program 1 times [2020-11-30 00:51:51,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:51,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684249729] [2020-11-30 00:51:51,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:51,249 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:51,266 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:51,274 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:51:53,752 WARN L193 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 215 DAG size of output: 173 [2020-11-30 00:51:54,303 WARN L193 SmtUtils]: Spent 525.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-11-30 00:51:54,306 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:51:54,307 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:51:54,307 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:51:54,307 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:51:54,307 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:51:54,307 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:54,307 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:51:54,307 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:51:54,307 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration11_Lasso [2020-11-30 00:51:54,307 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:51:54,307 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:51:54,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:54,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:51:55,074 WARN L193 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 95 [2020-11-30 00:51:55,200 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2020-11-30 00:51:55,851 WARN L193 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2020-11-30 00:51:56,274 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-11-30 00:51:56,321 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:51:56,321 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:56,328 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 [2020-11-30 00:51:56,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:56,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:56,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:56,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:56,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:56,330 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:56,331 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:51:56,332 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:56,360 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 [2020-11-30 00:51:56,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:56,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:56,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:56,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:56,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:51:56,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:51:56,366 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:51:56,426 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 [2020-11-30 00:51:56,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:56,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:56,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:56,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:56,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:56,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:56,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:56,432 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:56,472 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 [2020-11-30 00:51:56,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:56,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:56,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:56,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:56,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:56,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:56,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:51:56,476 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:56,504 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 [2020-11-30 00:51:56,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:56,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:56,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:56,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:56,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:56,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:56,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:51:56,508 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:56,539 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 [2020-11-30 00:51:56,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:56,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:56,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:56,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:56,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:56,542 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:56,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:51:56,544 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:51:56,597 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:56,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:56,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:56,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:56,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:56,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:56,600 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:56,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:51:56,602 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:56,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:51:56,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:56,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:56,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:56,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:56,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:56,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:56,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:51:56,634 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:56,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:51:56,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:56,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:56,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:56,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:56,667 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:51:56,667 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:51:56,679 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:56,712 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 [2020-11-30 00:51:56,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:56,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:56,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:56,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:56,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:56,715 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:56,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:51:56,716 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:56,752 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 [2020-11-30 00:51:56,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:56,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:56,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:56,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:56,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:51:56,757 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:51:56,771 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:51:56,819 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 [2020-11-30 00:51:56,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:56,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:56,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:56,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:56,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:56,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:56,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:56,839 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:51:56,888 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 [2020-11-30 00:51:56,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:56,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:56,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:56,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:56,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:56,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:56,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:56,893 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:56,923 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 [2020-11-30 00:51:56,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:56,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:56,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:56,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:56,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:56,926 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:56,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:51:56,927 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:56,956 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 [2020-11-30 00:51:56,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:56,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:56,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:56,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:56,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:56,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:56,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:51:56,960 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:56,989 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 [2020-11-30 00:51:56,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:56,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:56,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:56,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:56,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:56,991 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:56,991 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:51:56,993 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:57,021 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 [2020-11-30 00:51:57,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:57,023 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:57,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:57,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:57,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:57,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:57,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:51:57,025 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:57,055 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 [2020-11-30 00:51:57,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:57,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:57,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:57,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:57,058 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:51:57,059 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:51:57,083 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:51:57,130 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 [2020-11-30 00:51:57,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:57,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:57,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:57,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:57,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:57,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:57,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:57,136 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:57,169 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 [2020-11-30 00:51:57,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:57,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:57,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:57,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:57,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:57,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:57,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:51:57,190 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:57,221 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 [2020-11-30 00:51:57,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:57,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:57,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:57,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:57,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:57,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:57,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:51:57,225 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:57,253 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 [2020-11-30 00:51:57,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:57,255 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:57,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:57,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:57,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:57,256 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:57,256 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:51:57,267 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:57,297 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 [2020-11-30 00:51:57,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:57,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:57,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:57,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:57,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:57,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:57,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:51:57,306 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:57,335 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 [2020-11-30 00:51:57,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:57,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:57,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:57,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:57,340 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:51:57,340 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:51:57,344 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:57,372 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 [2020-11-30 00:51:57,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:57,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:57,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:57,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:57,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:57,375 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:57,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:51:57,382 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:57,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 [2020-11-30 00:51:57,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:57,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:57,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:57,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:57,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:57,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:57,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:51:57,425 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:57,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:51:57,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:57,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:57,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:57,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:57,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:57,458 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:57,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:51:57,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_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:57,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:51:57,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:57,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:57,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:57,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:57,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:57,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:57,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:51:57,494 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:57,523 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 [2020-11-30 00:51:57,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:57,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:57,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:57,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:57,526 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:51:57,526 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:51:57,546 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:57,592 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:51:57,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:57,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:51:57,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:57,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:57,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:57,595 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:51:57,596 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:51:57,627 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:51:57,728 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:57,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:57,731 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-11-30 00:51:57,731 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2020-11-30 00:51:57,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:57,771 INFO L401 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2020-11-30 00:51:57,771 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2020-11-30 00:51:57,849 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:57,890 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 [2020-11-30 00:51:57,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:57,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:57,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:57,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:57,893 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:51:57,893 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:51:57,896 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:57,925 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 [2020-11-30 00:51:57,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:57,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:57,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:57,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:57,928 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:51:57,928 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:51:57,931 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:57,959 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 [2020-11-30 00:51:57,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:57,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:57,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:57,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:57,966 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:51:57,966 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:51:57,973 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:51:58,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:58,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:58,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:58,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:58,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:58,005 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:51:58,005 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:51:58,008 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:58,036 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 [2020-11-30 00:51:58,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:58,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:58,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:58,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:58,060 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:51:58,061 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:51:58,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:58,101 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 [2020-11-30 00:51:58,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:51:58,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:51:58,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:51:58,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:51:58,122 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:51:58,122 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:51:58,147 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:51:58,204 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2020-11-30 00:51:58,205 INFO L444 ModelExtractionUtils]: 34 out of 67 variables were initially zero. Simplification set additionally 28 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:51:58,207 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-30 00:51:58,210 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-11-30 00:51:58,210 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:51:58,211 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrstr_~s.offset, ULTIMATE.start_main_~length1~0) = -1*ULTIMATE.start_cstrstr_~s.offset + 1*ULTIMATE.start_main_~length1~0 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_4 + 1*ULTIMATE.start_main_~length1~0 >= 0] [2020-11-30 00:51:58,325 INFO L297 tatePredicateManager]: 17 out of 20 supporting invariants were superfluous and have been removed [2020-11-30 00:51:58,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:58,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 00:51:58,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:51:58,419 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_131|], 1=[|v_#valid_152|]} [2020-11-30 00:51:58,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:51:58,424 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-11-30 00:51:58,424 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:51:58,442 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:51:58,448 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-11-30 00:51:58,451 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:51:58,462 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:51:58,463 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:51:58,464 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:22, output treesize:10 [2020-11-30 00:51:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:58,536 WARN L261 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-30 00:51:58,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:51:58,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:51:58,577 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2020-11-30 00:51:58,577 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 59 transitions. cyclomatic complexity: 14 Second operand 5 states. [2020-11-30 00:51:58,682 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 59 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 67 states and 78 transitions. Complement of second has 6 states. [2020-11-30 00:51:58,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-30 00:51:58,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-11-30 00:51:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2020-11-30 00:51:58,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 23 letters. Loop has 3 letters. [2020-11-30 00:51:58,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:51:58,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 26 letters. Loop has 3 letters. [2020-11-30 00:51:58,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:51:58,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 23 letters. Loop has 6 letters. [2020-11-30 00:51:58,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:51:58,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 78 transitions. [2020-11-30 00:51:58,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:51:58,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 50 states and 58 transitions. [2020-11-30 00:51:58,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-11-30 00:51:58,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-11-30 00:51:58,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 58 transitions. [2020-11-30 00:51:58,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:51:58,688 INFO L691 BuchiCegarLoop]: Abstraction has 50 states and 58 transitions. [2020-11-30 00:51:58,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 58 transitions. [2020-11-30 00:51:58,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-11-30 00:51:58,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-11-30 00:51:58,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2020-11-30 00:51:58,692 INFO L714 BuchiCegarLoop]: Abstraction has 50 states and 58 transitions. [2020-11-30 00:51:58,692 INFO L594 BuchiCegarLoop]: Abstraction has 50 states and 58 transitions. [2020-11-30 00:51:58,692 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-11-30 00:51:58,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 58 transitions. [2020-11-30 00:51:58,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:51:58,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:51:58,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:51:58,695 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:51:58,695 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-11-30 00:51:58,695 INFO L794 eck$LassoCheckResult]: Stem: 1992#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1964#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 1955#L555 assume !(main_~length1~0 < 1); 1956#L555-2 assume !(main_~length2~0 < 1); 1981#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 1982#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 1994#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 1995#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 1997#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 1999#L564-3 assume !(main_~i~0 < main_~length1~0); 1998#L564-4 main_~i~1 := 0; 1962#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 1953#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 1954#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 1963#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 2002#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 2001#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 2000#L568-3 assume !(main_~i~1 < main_~length2~0); 1990#L568-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 1991#L540 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 1983#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1984#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1975#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 1976#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1985#L518-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1986#L518-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 1987#L520 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 1993#L542-4 goto; 1965#L543-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 1957#L544 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 1959#L543 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 1988#L542-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 1977#L525 assume !(0 == cstrncmp_~n % 4294967296); 1978#L527-4 [2020-11-30 00:51:58,696 INFO L796 eck$LassoCheckResult]: Loop: 1978#L527-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 1971#L528 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, 1 + cstrncmp_#t~post11.offset;call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); 1967#L530 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~mem12;havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset; 1968#L527-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 1973#L527-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 1978#L527-4 [2020-11-30 00:51:58,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:58,696 INFO L82 PathProgramCache]: Analyzing trace with hash 577420407, now seen corresponding path program 1 times [2020-11-30 00:51:58,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:58,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460689291] [2020-11-30 00:51:58,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:58,738 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:58,780 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:58,792 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:51:58,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:58,793 INFO L82 PathProgramCache]: Analyzing trace with hash 118492775, now seen corresponding path program 1 times [2020-11-30 00:51:58,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:58,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936916332] [2020-11-30 00:51:58,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:58,802 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:51:58,809 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:51:58,811 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:51:58,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:58,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1867951025, now seen corresponding path program 1 times [2020-11-30 00:51:58,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:58,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826471394] [2020-11-30 00:51:58,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:59,108 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-30 00:51:59,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826471394] [2020-11-30 00:51:59,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611378141] [2020-11-30 00:51:59,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:51:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:59,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 00:51:59,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:51:59,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-30 00:51:59,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:51:59,312 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-30 00:51:59,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:51:59,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-11-30 00:51:59,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195969636] [2020-11-30 00:51:59,542 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2020-11-30 00:51:59,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:51:59,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 00:51:59,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:51:59,606 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. cyclomatic complexity: 13 Second operand 9 states. [2020-11-30 00:51:59,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:51:59,817 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2020-11-30 00:51:59,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:51:59,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 99 transitions. [2020-11-30 00:51:59,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:51:59,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 55 states and 63 transitions. [2020-11-30 00:51:59,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-11-30 00:51:59,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-11-30 00:51:59,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 63 transitions. [2020-11-30 00:51:59,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:51:59,821 INFO L691 BuchiCegarLoop]: Abstraction has 55 states and 63 transitions. [2020-11-30 00:51:59,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 63 transitions. [2020-11-30 00:51:59,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2020-11-30 00:51:59,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-30 00:51:59,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2020-11-30 00:51:59,826 INFO L714 BuchiCegarLoop]: Abstraction has 53 states and 61 transitions. [2020-11-30 00:51:59,826 INFO L594 BuchiCegarLoop]: Abstraction has 53 states and 61 transitions. [2020-11-30 00:51:59,826 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-11-30 00:51:59,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 61 transitions. [2020-11-30 00:51:59,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:51:59,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:51:59,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:51:59,829 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:51:59,829 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-11-30 00:51:59,829 INFO L794 eck$LassoCheckResult]: Stem: 2262#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2234#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 2225#L555 assume !(main_~length1~0 < 1); 2226#L555-2 assume !(main_~length2~0 < 1); 2251#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 2252#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 2264#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 2265#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 2267#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 2272#L564-3 assume !(main_~i~0 < main_~length1~0); 2268#L564-4 main_~i~1 := 0; 2232#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 2223#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 2224#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 2233#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 2275#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 2274#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 2273#L568-3 assume !(main_~i~1 < main_~length2~0); 2260#L568-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 2261#L540 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 2253#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 2254#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 2245#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 2246#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 2255#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 2270#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 2271#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 2269#L518-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 2256#L518-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 2257#L520 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 2263#L542-4 goto; 2235#L543-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 2227#L544 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 2229#L543 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 2258#L542-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 2247#L525 assume !(0 == cstrncmp_~n % 4294967296); 2248#L527-4 [2020-11-30 00:51:59,830 INFO L796 eck$LassoCheckResult]: Loop: 2248#L527-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 2241#L528 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, 1 + cstrncmp_#t~post11.offset;call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); 2237#L530 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~mem12;havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset; 2238#L527-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 2243#L527-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 2248#L527-4 [2020-11-30 00:51:59,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:51:59,830 INFO L82 PathProgramCache]: Analyzing trace with hash 609290751, now seen corresponding path program 2 times [2020-11-30 00:51:59,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:51:59,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823002191] [2020-11-30 00:51:59,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:51:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:51:59,990 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 00:51:59,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823002191] [2020-11-30 00:51:59,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707093729] [2020-11-30 00:51:59,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:52:00,113 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 00:52:00,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:52:00,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 28 conjunts are in the unsatisfiable core [2020-11-30 00:52:00,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:52:00,184 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:52:00,184 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-11-30 00:52:00,185 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:52:00,216 INFO L625 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2020-11-30 00:52:00,219 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:52:00,219 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:9, output treesize:5 [2020-11-30 00:52:00,417 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:52:00,417 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-30 00:52:00,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:52:00,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:52:00,424 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:52:00,427 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:52:00,427 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:52:00,427 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2020-11-30 00:52:00,451 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 00:52:00,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:52:00,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 18 [2020-11-30 00:52:00,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784836275] [2020-11-30 00:52:00,453 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:52:00,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:52:00,454 INFO L82 PathProgramCache]: Analyzing trace with hash 118492775, now seen corresponding path program 2 times [2020-11-30 00:52:00,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:52:00,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729614351] [2020-11-30 00:52:00,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:52:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:52:00,462 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:52:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:52:00,471 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:52:00,474 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:52:00,706 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2020-11-30 00:52:00,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:52:00,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-30 00:52:00,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2020-11-30 00:52:00,771 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. cyclomatic complexity: 13 Second operand 18 states. [2020-11-30 00:52:01,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:52:01,233 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2020-11-30 00:52:01,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-30 00:52:01,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 73 transitions. [2020-11-30 00:52:01,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:52:01,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 56 states and 64 transitions. [2020-11-30 00:52:01,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-11-30 00:52:01,237 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-11-30 00:52:01,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 64 transitions. [2020-11-30 00:52:01,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:52:01,237 INFO L691 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2020-11-30 00:52:01,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 64 transitions. [2020-11-30 00:52:01,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2020-11-30 00:52:01,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-11-30 00:52:01,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2020-11-30 00:52:01,246 INFO L714 BuchiCegarLoop]: Abstraction has 55 states and 63 transitions. [2020-11-30 00:52:01,246 INFO L594 BuchiCegarLoop]: Abstraction has 55 states and 63 transitions. [2020-11-30 00:52:01,246 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-11-30 00:52:01,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 63 transitions. [2020-11-30 00:52:01,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:52:01,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:52:01,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:52:01,251 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:52:01,252 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-11-30 00:52:01,254 INFO L794 eck$LassoCheckResult]: Stem: 2517#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2489#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 2479#L555 assume !(main_~length1~0 < 1); 2480#L555-2 assume !(main_~length2~0 < 1); 2506#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 2507#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 2519#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 2520#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 2522#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 2526#L564-3 assume !(main_~i~0 < main_~length1~0); 2523#L564-4 main_~i~1 := 0; 2486#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 2487#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 2488#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 2477#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 2478#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 2531#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 2530#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 2529#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 2528#L568-3 assume !(main_~i~1 < main_~length2~0); 2515#L568-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 2516#L540 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 2508#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 2509#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 2500#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 2501#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 2510#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 2527#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 2525#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 2524#L518-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 2511#L518-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 2512#L520 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 2518#L542-4 goto; 2490#L543-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 2481#L544 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 2483#L543 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 2513#L542-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 2502#L525 assume !(0 == cstrncmp_~n % 4294967296); 2503#L527-4 [2020-11-30 00:52:01,255 INFO L796 eck$LassoCheckResult]: Loop: 2503#L527-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 2496#L528 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, 1 + cstrncmp_#t~post11.offset;call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); 2492#L530 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~mem12;havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset; 2493#L527-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 2498#L527-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 2503#L527-4 [2020-11-30 00:52:01,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:52:01,255 INFO L82 PathProgramCache]: Analyzing trace with hash -679136227, now seen corresponding path program 3 times [2020-11-30 00:52:01,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:52:01,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156528755] [2020-11-30 00:52:01,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:52:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:52:01,299 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:52:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:52:01,343 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:52:01,352 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:52:01,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:52:01,353 INFO L82 PathProgramCache]: Analyzing trace with hash 118492775, now seen corresponding path program 3 times [2020-11-30 00:52:01,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:52:01,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203155796] [2020-11-30 00:52:01,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:52:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:52:01,362 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:52:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:52:01,368 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:52:01,370 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:52:01,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:52:01,372 INFO L82 PathProgramCache]: Analyzing trace with hash 108202955, now seen corresponding path program 2 times [2020-11-30 00:52:01,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:52:01,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966008019] [2020-11-30 00:52:01,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:52:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:01,865 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-11-30 00:52:01,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966008019] [2020-11-30 00:52:01,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694531728] [2020-11-30 00:52:01,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:52:01,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 00:52:01,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:52:02,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 77 conjunts are in the unsatisfiable core [2020-11-30 00:52:02,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:52:02,012 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_135|], 1=[|v_#valid_155|]} [2020-11-30 00:52:02,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 00:52:02,021 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-11-30 00:52:02,021 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:52:02,042 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:52:02,049 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-11-30 00:52:02,051 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:52:02,065 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:52:02,066 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:52:02,066 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2020-11-30 00:52:02,710 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2020-11-30 00:52:02,710 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:52:02,747 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:52:02,748 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 00:52:02,749 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:52 [2020-11-30 00:52:03,216 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:52:03,217 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 51 [2020-11-30 00:52:03,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:52:03,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:52:03,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:52:03,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:52:03,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:52:03,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:52:03,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:52:03,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:52:03,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:52:03,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:52:03,242 INFO L545 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-11-30 00:52:03,315 INFO L625 ElimStorePlain]: treesize reduction 4, result has 93.1 percent of original size [2020-11-30 00:52:03,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:52:03,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:52:03,324 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 00:52:03,324 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:54 [2020-11-30 00:52:03,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:52:03,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:52:03,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:52:03,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:52:03,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:52:04,104 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:52:04,105 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 [2020-11-30 00:52:04,106 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-11-30 00:52:04,178 INFO L625 ElimStorePlain]: treesize reduction 8, result has 75.8 percent of original size [2020-11-30 00:52:04,182 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:52:04,182 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2020-11-30 00:52:04,210 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:52:04,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:52:04,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22] total 30 [2020-11-30 00:52:04,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741539808] [2020-11-30 00:52:04,432 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2020-11-30 00:52:04,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:52:04,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-11-30 00:52:04,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2020-11-30 00:52:04,506 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. cyclomatic complexity: 13 Second operand 30 states. [2020-11-30 00:52:05,855 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2020-11-30 00:52:06,192 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2020-11-30 00:52:06,612 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2020-11-30 00:52:06,891 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2020-11-30 00:52:07,813 WARN L193 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2020-11-30 00:52:08,116 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 93 [2020-11-30 00:52:20,821 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2020-11-30 00:52:21,056 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2020-11-30 00:52:21,364 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2020-11-30 00:52:21,817 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2020-11-30 00:52:21,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:52:21,950 INFO L93 Difference]: Finished difference Result 191 states and 216 transitions. [2020-11-30 00:52:21,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-30 00:52:21,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 216 transitions. [2020-11-30 00:52:21,953 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-11-30 00:52:21,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 177 states and 202 transitions. [2020-11-30 00:52:21,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2020-11-30 00:52:21,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2020-11-30 00:52:21,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 177 states and 202 transitions. [2020-11-30 00:52:21,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:52:21,956 INFO L691 BuchiCegarLoop]: Abstraction has 177 states and 202 transitions. [2020-11-30 00:52:21,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states and 202 transitions. [2020-11-30 00:52:21,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 87. [2020-11-30 00:52:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-11-30 00:52:21,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2020-11-30 00:52:21,962 INFO L714 BuchiCegarLoop]: Abstraction has 87 states and 99 transitions. [2020-11-30 00:52:21,962 INFO L594 BuchiCegarLoop]: Abstraction has 87 states and 99 transitions. [2020-11-30 00:52:21,962 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-11-30 00:52:21,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 99 transitions. [2020-11-30 00:52:21,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:52:21,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:52:21,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:52:21,965 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:52:21,965 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-11-30 00:52:21,965 INFO L794 eck$LassoCheckResult]: Stem: 2977#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2948#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 2938#L555 assume !(main_~length1~0 < 1); 2939#L555-2 assume !(main_~length2~0 < 1); 2966#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 2967#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 2980#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 2981#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 2983#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 2989#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 2991#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 2992#L564-3 assume !(main_~i~0 < main_~length1~0); 2984#L564-4 main_~i~1 := 0; 2985#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 3020#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 3019#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 3018#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 3017#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 3016#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 3015#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 3014#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 3013#L568-3 assume !(main_~i~1 < main_~length2~0); 3012#L568-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 3011#L540 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 3010#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 3009#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 3008#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 3007#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 3005#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 3006#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 3004#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 3003#L518-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 3002#L518-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 3001#L520 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 3000#L542-4 goto; 2949#L543-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 2940#L544 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 2942#L543 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 2973#L542-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 2961#L525 assume !(0 == cstrncmp_~n % 4294967296); 2962#L527-4 [2020-11-30 00:52:21,965 INFO L796 eck$LassoCheckResult]: Loop: 2962#L527-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 2955#L528 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, 1 + cstrncmp_#t~post11.offset;call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); 2951#L530 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~mem12;havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset; 2952#L527-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 2957#L527-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 2962#L527-4 [2020-11-30 00:52:21,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:52:21,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1202872581, now seen corresponding path program 4 times [2020-11-30 00:52:21,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:52:21,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694223505] [2020-11-30 00:52:21,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:52:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:52:21,994 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:52:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:52:22,021 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:52:22,028 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:52:22,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:52:22,030 INFO L82 PathProgramCache]: Analyzing trace with hash 118492775, now seen corresponding path program 4 times [2020-11-30 00:52:22,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:52:22,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429348727] [2020-11-30 00:52:22,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:52:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:52:22,037 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:52:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:52:22,065 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:52:22,067 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:52:22,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:52:22,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1087325267, now seen corresponding path program 3 times [2020-11-30 00:52:22,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:52:22,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823276358] [2020-11-30 00:52:22,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:52:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:52:22,097 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:52:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:52:22,125 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:52:22,133 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:52:22,327 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2020-11-30 00:52:36,514 WARN L193 SmtUtils]: Spent 14.14 s on a formula simplification. DAG size of input: 337 DAG size of output: 263 [2020-11-30 00:52:38,445 WARN L193 SmtUtils]: Spent 1.90 s on a formula simplification that was a NOOP. DAG size: 176 [2020-11-30 00:52:38,450 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:52:38,450 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:52:38,450 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:52:38,450 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:52:38,450 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:52:38,450 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:52:38,450 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:52:38,450 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:52:38,450 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration15_Lasso [2020-11-30 00:52:38,451 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:52:38,451 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:52:38,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:38,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:38,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:38,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:38,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:38,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:38,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:40,784 WARN L193 SmtUtils]: Spent 975.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 140 [2020-11-30 00:52:41,359 WARN L193 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2020-11-30 00:52:41,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:41,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:52:42,629 WARN L193 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 101 [2020-11-30 00:52:43,050 WARN L193 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2020-11-30 00:52:43,294 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2020-11-30 00:52:43,862 WARN L193 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-11-30 00:52:44,007 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-11-30 00:52:44,268 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2020-11-30 00:52:44,471 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:52:44,472 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:52:44,476 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 [2020-11-30 00:52:44,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:52:44,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:52:44,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:52:44,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:52:44,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:52:44,478 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:52:44,478 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:52:44,480 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:52:44,509 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 [2020-11-30 00:52:44,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:52:44,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:52:44,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:52:44,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:52:44,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:52:44,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:52:44,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:52:44,513 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:52:44,543 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 [2020-11-30 00:52:44,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:52:44,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:52:44,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:52:44,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:52:44,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:52:44,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:52:44,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:52:44,547 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:52:44,584 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 [2020-11-30 00:52:44,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:52:44,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:52:44,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:52:44,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:52:44,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:52:44,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:52:44,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:52:44,590 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:52:44,626 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 [2020-11-30 00:52:44,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:52:44,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:52:44,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:52:44,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:52:44,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:52:44,628 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:52:44,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:52:44,630 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:52:44,657 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 [2020-11-30 00:52:44,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:52:44,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:52:44,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:52:44,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:52:44,660 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:52:44,660 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:52:44,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:52:44,693 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 [2020-11-30 00:52:44,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:52:44,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:52:44,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:52:44,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:52:44,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:52:44,742 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:52:44,811 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:52:44,972 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2020-11-30 00:52:44,972 INFO L444 ModelExtractionUtils]: 48 out of 94 variables were initially zero. Simplification set additionally 41 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 79 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:52:44,975 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-30 00:52:44,978 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-11-30 00:52:44,978 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:52:44,978 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc22.base)_5, ULTIMATE.start_cstrncmp_~s2.offset) = 4*v_rep(select #length ULTIMATE.start_main_#t~malloc22.base)_5 - 3*ULTIMATE.start_cstrncmp_~s2.offset Supporting invariants [4*v_rep(select #length ULTIMATE.start_main_#t~malloc22.base)_5 - 3*v_rep(select #length ULTIMATE.start_cstrlen_~str.base)_1 >= 0] [2020-11-30 00:52:45,527 INFO L297 tatePredicateManager]: 64 out of 66 supporting invariants were superfluous and have been removed [2020-11-30 00:52:45,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-30 00:52:45,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:52:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:45,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 33 conjunts are in the unsatisfiable core [2020-11-30 00:52:45,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:52:45,725 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:52:45,726 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-11-30 00:52:45,726 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:52:45,768 INFO L625 ElimStorePlain]: treesize reduction 10, result has 71.4 percent of original size [2020-11-30 00:52:45,769 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:52:45,769 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2020-11-30 00:52:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:46,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 00:52:46,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:52:46,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:52:46,511 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.14 stem predicates 2 loop predicates [2020-11-30 00:52:46,512 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 87 states and 99 transitions. cyclomatic complexity: 19 Second operand 16 states. [2020-11-30 00:52:48,206 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 87 states and 99 transitions. cyclomatic complexity: 19. Second operand 16 states. Result 151 states and 172 transitions. Complement of second has 19 states. [2020-11-30 00:52:48,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 14 stem states 1 non-accepting loop states 2 accepting loop states [2020-11-30 00:52:48,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-11-30 00:52:48,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2020-11-30 00:52:48,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 86 transitions. Stem has 40 letters. Loop has 5 letters. [2020-11-30 00:52:48,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:52:48,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 86 transitions. Stem has 45 letters. Loop has 5 letters. [2020-11-30 00:52:48,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:52:48,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 86 transitions. Stem has 40 letters. Loop has 10 letters. [2020-11-30 00:52:48,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:52:48,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 172 transitions. [2020-11-30 00:52:48,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:52:48,218 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 134 states and 154 transitions. [2020-11-30 00:52:48,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2020-11-30 00:52:48,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2020-11-30 00:52:48,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 154 transitions. [2020-11-30 00:52:48,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:52:48,219 INFO L691 BuchiCegarLoop]: Abstraction has 134 states and 154 transitions. [2020-11-30 00:52:48,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 154 transitions. [2020-11-30 00:52:48,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 106. [2020-11-30 00:52:48,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-11-30 00:52:48,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2020-11-30 00:52:48,225 INFO L714 BuchiCegarLoop]: Abstraction has 106 states and 121 transitions. [2020-11-30 00:52:48,225 INFO L594 BuchiCegarLoop]: Abstraction has 106 states and 121 transitions. [2020-11-30 00:52:48,225 INFO L427 BuchiCegarLoop]: ======== Iteration 16============ [2020-11-30 00:52:48,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 121 transitions. [2020-11-30 00:52:48,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:52:48,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:52:48,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:52:48,228 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:52:48,228 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-11-30 00:52:48,229 INFO L794 eck$LassoCheckResult]: Stem: 3693#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3663#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 3655#L555 assume !(main_~length1~0 < 1); 3656#L555-2 assume !(main_~length2~0 < 1); 3680#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 3681#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 3700#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 3701#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 3695#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 3696#L564-3 assume !(main_~i~0 < main_~length1~0); 3702#L564-4 main_~i~1 := 0; 3703#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 3737#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 3736#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 3735#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 3734#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 3733#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 3732#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 3731#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 3730#L568-3 assume !(main_~i~1 < main_~length2~0); 3729#L568-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 3728#L540 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 3727#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 3726#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 3725#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 3724#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 3722#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 3723#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 3721#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 3720#L518-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 3719#L518-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 3718#L520 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 3717#L542-4 goto; 3716#L543-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 3715#L544 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 3714#L543 assume !!(cstrstr_~sc~0 != cstrstr_~c~0); 3707#L543-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 3745#L544 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 3688#L543 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 3689#L542-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 3676#L525 assume !(0 == cstrncmp_~n % 4294967296); 3677#L527-4 [2020-11-30 00:52:48,229 INFO L796 eck$LassoCheckResult]: Loop: 3677#L527-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 3670#L528 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, 1 + cstrncmp_#t~post11.offset;call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); 3666#L530 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~mem12;havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset; 3667#L527-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 3672#L527-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 3677#L527-4 [2020-11-30 00:52:48,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:52:48,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1486630165, now seen corresponding path program 1 times [2020-11-30 00:52:48,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:52:48,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979720931] [2020-11-30 00:52:48,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:52:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:48,797 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-11-30 00:52:48,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979720931] [2020-11-30 00:52:48,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503012372] [2020-11-30 00:52:48,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:52:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:48,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 86 conjunts are in the unsatisfiable core [2020-11-30 00:52:48,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:52:48,964 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-11-30 00:52:48,966 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:52:48,974 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:52:48,975 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:52:48,975 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2020-11-30 00:52:49,489 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 21 [2020-11-30 00:52:49,490 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:52:49,530 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:52:49,531 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 00:52:49,531 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:37 [2020-11-30 00:52:50,234 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:52:50,234 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 [2020-11-30 00:52:50,236 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-11-30 00:52:50,291 INFO L625 ElimStorePlain]: treesize reduction 8, result has 75.0 percent of original size [2020-11-30 00:52:50,296 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:52:50,296 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:48, output treesize:8 [2020-11-30 00:52:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:52:50,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:52:50,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 20] total 29 [2020-11-30 00:52:50,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146289625] [2020-11-30 00:52:50,397 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:52:50,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:52:50,397 INFO L82 PathProgramCache]: Analyzing trace with hash 118492775, now seen corresponding path program 5 times [2020-11-30 00:52:50,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:52:50,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510959931] [2020-11-30 00:52:50,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:52:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:52:50,408 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:52:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:52:50,414 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:52:50,416 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:52:50,672 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2020-11-30 00:52:50,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:52:50,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-11-30 00:52:50,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2020-11-30 00:52:50,746 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. cyclomatic complexity: 24 Second operand 29 states. [2020-11-30 00:52:59,246 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2020-11-30 00:52:59,667 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2020-11-30 00:52:59,991 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2020-11-30 00:53:00,239 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2020-11-30 00:53:00,444 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2020-11-30 00:53:01,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:53:01,261 INFO L93 Difference]: Finished difference Result 169 states and 189 transitions. [2020-11-30 00:53:01,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-30 00:53:01,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 189 transitions. [2020-11-30 00:53:01,265 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-11-30 00:53:01,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 140 states and 158 transitions. [2020-11-30 00:53:01,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2020-11-30 00:53:01,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2020-11-30 00:53:01,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 158 transitions. [2020-11-30 00:53:01,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:53:01,268 INFO L691 BuchiCegarLoop]: Abstraction has 140 states and 158 transitions. [2020-11-30 00:53:01,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 158 transitions. [2020-11-30 00:53:01,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 114. [2020-11-30 00:53:01,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-11-30 00:53:01,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2020-11-30 00:53:01,273 INFO L714 BuchiCegarLoop]: Abstraction has 114 states and 129 transitions. [2020-11-30 00:53:01,273 INFO L594 BuchiCegarLoop]: Abstraction has 114 states and 129 transitions. [2020-11-30 00:53:01,273 INFO L427 BuchiCegarLoop]: ======== Iteration 17============ [2020-11-30 00:53:01,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 129 transitions. [2020-11-30 00:53:01,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:53:01,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:53:01,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:53:01,275 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:53:01,275 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-11-30 00:53:01,276 INFO L794 eck$LassoCheckResult]: Stem: 4167#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 4134#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 4126#L555 assume !(main_~length1~0 < 1); 4127#L555-2 assume !(main_~length2~0 < 1); 4153#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 4154#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 4170#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 4171#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 4173#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 4177#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 4179#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 4181#L564-3 assume !(main_~i~0 < main_~length1~0); 4174#L564-4 main_~i~1 := 0; 4175#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 4210#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 4209#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 4208#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 4207#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 4206#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 4205#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 4204#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 4202#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 4201#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 4200#L568-3 assume !(main_~i~1 < main_~length2~0); 4199#L568-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 4198#L540 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 4197#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 4196#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 4195#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 4194#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 4192#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 4193#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 4191#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 4190#L518-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 4189#L518-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 4188#L520 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 4187#L542-4 goto; 4186#L543-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 4184#L544 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 4161#L543 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 4162#L542-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 4150#L525 assume !(0 == cstrncmp_~n % 4294967296); 4148#L527-4 [2020-11-30 00:53:01,276 INFO L796 eck$LassoCheckResult]: Loop: 4148#L527-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 4141#L528 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, 1 + cstrncmp_#t~post11.offset;call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); 4137#L530 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~mem12;havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset; 4138#L527-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 4144#L527-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 4148#L527-4 [2020-11-30 00:53:01,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:53:01,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1588623897, now seen corresponding path program 5 times [2020-11-30 00:53:01,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:53:01,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340203376] [2020-11-30 00:53:01,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:53:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:53:01,310 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:53:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:53:01,341 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:53:01,349 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:53:01,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:53:01,350 INFO L82 PathProgramCache]: Analyzing trace with hash 118492775, now seen corresponding path program 6 times [2020-11-30 00:53:01,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:53:01,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717967052] [2020-11-30 00:53:01,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:53:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:53:01,363 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:53:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:53:01,367 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:53:01,369 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:53:01,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:53:01,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1366285489, now seen corresponding path program 4 times [2020-11-30 00:53:01,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:53:01,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735008899] [2020-11-30 00:53:01,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:53:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:53:01,407 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:53:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:53:01,437 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:53:01,445 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:53:01,650 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2020-11-30 00:53:22,596 WARN L193 SmtUtils]: Spent 20.89 s on a formula simplification. DAG size of input: 351 DAG size of output: 272 [2020-11-30 00:53:25,482 WARN L193 SmtUtils]: Spent 2.87 s on a formula simplification that was a NOOP. DAG size: 178 [2020-11-30 00:53:25,487 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:53:25,487 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:53:25,487 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:53:25,487 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:53:25,487 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:53:25,487 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:53:25,488 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:53:25,488 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:53:25,488 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration17_Lasso [2020-11-30 00:53:25,488 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:53:25,488 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:53:25,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:25,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:25,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:25,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:25,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:25,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:25,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:25,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:25,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:25,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:25,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:25,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:25,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:25,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:25,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:25,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:25,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:25,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:25,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:28,904 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 173 DAG size of output: 144 [2020-11-30 00:53:29,533 WARN L193 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 92 [2020-11-30 00:53:29,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:29,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:29,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:29,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:29,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:29,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:29,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:29,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:29,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:29,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:29,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:29,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:29,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:29,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:29,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:29,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:29,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:29,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:29,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:29,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:29,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:29,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:29,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:29,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:53:30,588 WARN L193 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 91 [2020-11-30 00:53:31,022 WARN L193 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2020-11-30 00:53:31,202 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2020-11-30 00:53:31,653 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-11-30 00:53:32,040 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-11-30 00:53:32,144 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-11-30 00:53:32,423 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:53:32,423 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:53:32,432 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 [2020-11-30 00:53:32,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:53:32,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:53:32,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:53:32,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:53:32,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:53:32,435 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:53:32,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:53:32,436 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 82 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:53:32,465 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 [2020-11-30 00:53:32,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:53:32,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:53:32,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:53:32,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:53:32,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:53:32,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:53:32,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:53:32,469 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:53:32,501 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 [2020-11-30 00:53:32,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:53:32,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:53:32,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:53:32,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:53:32,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:53:32,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:53:32,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:53:32,505 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:53:32,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:53:32,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:53:32,534 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:53:32,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:53:32,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:53:32,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:53:32,535 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:53:32,535 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:53:32,536 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 85 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 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:53:32,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:53:32,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:53:32,566 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:53:32,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:53:32,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:53:32,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:53:32,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:53:32,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:53:32,567 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 86 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 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:53:32,595 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 [2020-11-30 00:53:32,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:53:32,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:53:32,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:53:32,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:53:32,598 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:53:32,599 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:53:32,602 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 87 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 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:53:32,628 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 [2020-11-30 00:53:32,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:53:32,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:53:32,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:53:32,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:53:32,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:53:32,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:53:32,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:53:32,632 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 88 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 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:53:32,661 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 [2020-11-30 00:53:32,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:53:32,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:53:32,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:53:32,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:53:32,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:53:32,663 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:53:32,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:53:32,664 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 89 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 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:53:32,691 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 [2020-11-30 00:53:32,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:53:32,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:53:32,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:53:32,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:53:32,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:53:32,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:53:32,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:53:32,694 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 90 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 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:53:32,722 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 [2020-11-30 00:53:32,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:53:32,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:53:32,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:53:32,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:53:32,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:53:32,724 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:53:32,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:53:32,725 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 91 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 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:53:32,752 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 [2020-11-30 00:53:32,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:53:32,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:53:32,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:53:32,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:53:32,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:53:32,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:53:32,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:53:32,756 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 92 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 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:53:32,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:53:32,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:53:32,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:53:32,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:53:32,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:53:32,786 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:53:32,786 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:53:32,789 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 93 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 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:53:32,819 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 [2020-11-30 00:53:32,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:53:32,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:53:32,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:53:32,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:53:32,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:53:32,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:53:32,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:53:32,823 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 94 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 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:53:32,861 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 [2020-11-30 00:53:32,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:53:32,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:53:32,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:53:32,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:53:32,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:53:32,869 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:53:32,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:53:32,871 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 95 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 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:53:32,899 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 [2020-11-30 00:53:32,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:53:32,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:53:32,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:53:32,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:53:32,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:53:32,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:53:32,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:53:32,902 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 96 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 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:53:32,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:53:32,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:53:32,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:53:32,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:53:32,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:53:32,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:53:32,932 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:53:32,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:53:32,934 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 97 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 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:53:32,963 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 [2020-11-30 00:53:32,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:53:32,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:53:32,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:53:32,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:53:32,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:53:32,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:53:32,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:53:32,967 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 98 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 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:53:32,995 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 [2020-11-30 00:53:32,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:53:32,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:53:32,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:53:32,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:53:32,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:53:32,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:53:32,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:53:32,999 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 99 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 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:53:33,028 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 [2020-11-30 00:53:33,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:53:33,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:53:33,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:53:33,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:53:33,032 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:53:33,032 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:53:33,035 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 100 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 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:53:33,061 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 [2020-11-30 00:53:33,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:53:33,063 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-11-30 00:53:33,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:53:33,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:53:33,064 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-11-30 00:53:33,064 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:53:33,067 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 101 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 101 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:53:33,094 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 [2020-11-30 00:53:33,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:53:33,097 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2020-11-30 00:53:33,097 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-11-30 00:53:33,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:53:33,136 INFO L401 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2020-11-30 00:53:33,137 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-11-30 00:53:33,207 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:53:33,256 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 [2020-11-30 00:53:33,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:53:33,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:53:33,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:53:33,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:53:33,264 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:53:33,264 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:53:33,272 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:53:33,316 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 [2020-11-30 00:53:33,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:53:33,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:53:33,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:53:33,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:53:33,324 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:53:33,325 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:53:33,333 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:53:33,378 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 [2020-11-30 00:53:33,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:53:33,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:53:33,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:53:33,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:53:33,383 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:53:33,383 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:53:33,387 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:53:33,433 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 [2020-11-30 00:53:33,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:53:33,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:53:33,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:53:33,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:53:33,474 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:53:33,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:53:33,535 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:53:33,645 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2020-11-30 00:53:33,645 INFO L444 ModelExtractionUtils]: 60 out of 88 variables were initially zero. Simplification set additionally 25 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 106 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:53:33,649 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 106 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:53:33,653 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-30 00:53:33,653 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:53:33,653 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~s1.offset, v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_6) = -1*ULTIMATE.start_cstrncmp_~s1.offset + 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_6 Supporting invariants [] [2020-11-30 00:53:34,210 INFO L297 tatePredicateManager]: 63 out of 65 supporting invariants were superfluous and have been removed [2020-11-30 00:53:34,218 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-30 00:53:34,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:53:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:34,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 16 conjunts are in the unsatisfiable core [2020-11-30 00:53:34,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:53:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:34,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-30 00:53:34,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:53:34,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:53:34,579 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2020-11-30 00:53:34,579 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 114 states and 129 transitions. cyclomatic complexity: 24 Second operand 7 states. [2020-11-30 00:53:34,777 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 114 states and 129 transitions. cyclomatic complexity: 24. Second operand 7 states. Result 171 states and 194 transitions. Complement of second has 10 states. [2020-11-30 00:53:34,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-30 00:53:34,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-11-30 00:53:34,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2020-11-30 00:53:34,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 42 letters. Loop has 5 letters. [2020-11-30 00:53:34,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:53:34,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 47 letters. Loop has 5 letters. [2020-11-30 00:53:34,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:53:34,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 42 letters. Loop has 10 letters. [2020-11-30 00:53:34,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:53:34,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 171 states and 194 transitions. [2020-11-30 00:53:34,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:53:34,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 171 states to 141 states and 161 transitions. [2020-11-30 00:53:34,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2020-11-30 00:53:34,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-11-30 00:53:34,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 161 transitions. [2020-11-30 00:53:34,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:53:34,787 INFO L691 BuchiCegarLoop]: Abstraction has 141 states and 161 transitions. [2020-11-30 00:53:34,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 161 transitions. [2020-11-30 00:53:34,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 113. [2020-11-30 00:53:34,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-11-30 00:53:34,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 128 transitions. [2020-11-30 00:53:34,796 INFO L714 BuchiCegarLoop]: Abstraction has 113 states and 128 transitions. [2020-11-30 00:53:34,796 INFO L594 BuchiCegarLoop]: Abstraction has 113 states and 128 transitions. [2020-11-30 00:53:34,796 INFO L427 BuchiCegarLoop]: ======== Iteration 18============ [2020-11-30 00:53:34,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 128 transitions. [2020-11-30 00:53:34,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:53:34,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:53:34,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:53:34,801 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:53:34,801 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-11-30 00:53:34,802 INFO L794 eck$LassoCheckResult]: Stem: 4890#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 4859#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 4851#L555 assume !(main_~length1~0 < 1); 4852#L555-2 assume !(main_~length2~0 < 1); 4873#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 4874#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 4896#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 4897#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 4898#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 4904#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 4893#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 4894#L564-3 assume !(main_~i~0 < main_~length1~0); 4899#L564-4 main_~i~1 := 0; 4900#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 4961#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 4959#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 4957#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 4955#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 4953#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 4931#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 4929#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 4928#L568-3 assume !(main_~i~1 < main_~length2~0); 4888#L568-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 4889#L540 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 4880#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 4881#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 4871#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 4872#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 4882#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 4946#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 4944#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 4901#L518-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 4883#L518-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 4884#L520 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 4891#L542-4 goto; 4902#L543-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 4930#L544 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 4927#L543 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 4925#L542-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 4921#L525 assume !(0 == cstrncmp_~n % 4294967296); 4919#L527-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 4916#L528 assume cstrncmp_#t~mem6 != cstrncmp_#t~mem7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;call cstrncmp_#t~mem9 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;call cstrncmp_#t~mem10 := read~int(cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, 1);cstrncmp_#res := cstrncmp_#t~mem9 % 256 - cstrncmp_#t~mem10 % 256;havoc cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset;havoc cstrncmp_#t~mem10;havoc cstrncmp_#t~mem9; 4915#L533 cstrstr_#t~ret16 := cstrncmp_#res; 4914#L542-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 4913#L542-4 goto; 4911#L543-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 4908#L544 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 4885#L543 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 4886#L542-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 4875#L525 assume !(0 == cstrncmp_~n % 4294967296); 4876#L527-4 [2020-11-30 00:53:34,803 INFO L796 eck$LassoCheckResult]: Loop: 4876#L527-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 4867#L528 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, 1 + cstrncmp_#t~post11.offset;call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); 4863#L530 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~mem12;havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset; 4864#L527-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 4869#L527-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 4876#L527-4 [2020-11-30 00:53:34,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:53:34,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1519050033, now seen corresponding path program 1 times [2020-11-30 00:53:34,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:53:34,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333898988] [2020-11-30 00:53:34,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:53:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:53:34,854 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:53:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:53:34,887 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:53:34,897 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:53:34,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:53:34,899 INFO L82 PathProgramCache]: Analyzing trace with hash 118492775, now seen corresponding path program 7 times [2020-11-30 00:53:34,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:53:34,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175187116] [2020-11-30 00:53:34,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:53:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:53:34,904 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:53:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:53:34,909 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:53:34,910 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:53:34,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:53:34,913 INFO L82 PathProgramCache]: Analyzing trace with hash -419005351, now seen corresponding path program 1 times [2020-11-30 00:53:34,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:53:34,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550974182] [2020-11-30 00:53:34,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:53:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-11-30 00:53:35,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550974182] [2020-11-30 00:53:35,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190525655] [2020-11-30 00:53:35,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:53:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:35,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 132 conjunts are in the unsatisfiable core [2020-11-30 00:53:35,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:53:35,625 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-11-30 00:53:35,626 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:35,636 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:35,636 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:53:35,636 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2020-11-30 00:53:36,388 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 21 [2020-11-30 00:53:36,389 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:36,412 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:36,413 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 00:53:36,414 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:37 [2020-11-30 00:53:37,912 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:37,913 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 39 [2020-11-30 00:53:37,914 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:37,986 INFO L625 ElimStorePlain]: treesize reduction 19, result has 55.8 percent of original size [2020-11-30 00:53:37,991 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:53:37,991 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:8 [2020-11-30 00:53:38,154 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:53:38,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:53:38,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 26] total 37 [2020-11-30 00:53:38,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202936808] [2020-11-30 00:53:38,507 WARN L193 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2020-11-30 00:53:38,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:53:38,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2020-11-30 00:53:38,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1230, Unknown=0, NotChecked=0, Total=1332 [2020-11-30 00:53:38,582 INFO L87 Difference]: Start difference. First operand 113 states and 128 transitions. cyclomatic complexity: 24 Second operand 37 states. [2020-11-30 00:53:40,464 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-11-30 00:53:40,675 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-11-30 00:53:40,975 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-11-30 00:53:41,185 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2020-11-30 00:53:42,038 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2020-11-30 00:53:42,459 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2020-11-30 00:53:42,751 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2020-11-30 00:53:43,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:53:43,449 INFO L93 Difference]: Finished difference Result 368 states and 420 transitions. [2020-11-30 00:53:43,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-11-30 00:53:43,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 368 states and 420 transitions. [2020-11-30 00:53:43,458 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2020-11-30 00:53:43,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 368 states to 353 states and 405 transitions. [2020-11-30 00:53:43,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2020-11-30 00:53:43,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2020-11-30 00:53:43,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 353 states and 405 transitions. [2020-11-30 00:53:43,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:53:43,463 INFO L691 BuchiCegarLoop]: Abstraction has 353 states and 405 transitions. [2020-11-30 00:53:43,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states and 405 transitions. [2020-11-30 00:53:43,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 164. [2020-11-30 00:53:43,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-11-30 00:53:43,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 187 transitions. [2020-11-30 00:53:43,483 INFO L714 BuchiCegarLoop]: Abstraction has 164 states and 187 transitions. [2020-11-30 00:53:43,483 INFO L594 BuchiCegarLoop]: Abstraction has 164 states and 187 transitions. [2020-11-30 00:53:43,484 INFO L427 BuchiCegarLoop]: ======== Iteration 19============ [2020-11-30 00:53:43,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 164 states and 187 transitions. [2020-11-30 00:53:43,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:53:43,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:53:43,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:53:43,486 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:53:43,487 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-11-30 00:53:43,487 INFO L794 eck$LassoCheckResult]: Stem: 5641#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 5607#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 5598#L555 assume !(main_~length1~0 < 1); 5599#L555-2 assume !(main_~length2~0 < 1); 5621#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 5622#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 5645#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 5646#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 5650#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 5688#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 5663#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 5664#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 5662#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 5660#L564-3 assume !(main_~i~0 < main_~length1~0); 5661#L564-4 main_~i~1 := 0; 5602#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 5603#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 5683#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 5684#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 5679#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 5680#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 5730#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 5729#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 5727#L568-3 assume !(main_~i~1 < main_~length2~0); 5728#L568-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 5725#L540 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 5726#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 5723#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 5724#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 5721#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 5722#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 5619#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 5620#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 5653#L518-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 5654#L518-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 5642#L520 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 5643#L542-4 goto; 5608#L543-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 5600#L544 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 5601#L543 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 5644#L542-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 5625#L525 assume !(0 == cstrncmp_~n % 4294967296); 5626#L527-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 5635#L528 assume cstrncmp_#t~mem6 != cstrncmp_#t~mem7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;call cstrncmp_#t~mem9 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;call cstrncmp_#t~mem10 := read~int(cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, 1);cstrncmp_#res := cstrncmp_#t~mem9 % 256 - cstrncmp_#t~mem10 % 256;havoc cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset;havoc cstrncmp_#t~mem10;havoc cstrncmp_#t~mem9; 5605#L533 cstrstr_#t~ret16 := cstrncmp_#res; 5606#L542-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 5649#L542-4 goto; 5691#L543-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 5689#L544 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~mem18;havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset; 5636#L543 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 5637#L542-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 5623#L525 assume !(0 == cstrncmp_~n % 4294967296); 5624#L527-4 [2020-11-30 00:53:43,487 INFO L796 eck$LassoCheckResult]: Loop: 5624#L527-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 5615#L528 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, 1 + cstrncmp_#t~post11.offset;call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); 5610#L530 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~mem12;havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset; 5611#L527-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 5617#L527-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 5624#L527-4 [2020-11-30 00:53:43,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:53:43,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1332858707, now seen corresponding path program 2 times [2020-11-30 00:53:43,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:53:43,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444443445] [2020-11-30 00:53:43,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:53:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:53:43,533 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:53:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:53:43,568 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:53:43,578 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:53:43,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:53:43,579 INFO L82 PathProgramCache]: Analyzing trace with hash 118492775, now seen corresponding path program 8 times [2020-11-30 00:53:43,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:53:43,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604797223] [2020-11-30 00:53:43,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:53:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:53:43,584 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:53:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:53:43,589 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:53:43,591 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:53:43,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:53:43,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1922995909, now seen corresponding path program 2 times [2020-11-30 00:53:43,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:53:43,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766545100] [2020-11-30 00:53:43,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:53:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:53:43,651 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:53:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:53:43,694 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:53:43,704 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:53:44,002 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2020-11-30 00:54:22,336 WARN L193 SmtUtils]: Spent 38.24 s on a formula simplification. DAG size of input: 449 DAG size of output: 343 [2020-11-30 00:54:26,814 WARN L193 SmtUtils]: Spent 4.42 s on a formula simplification that was a NOOP. DAG size: 193 [2020-11-30 00:54:26,819 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:54:26,820 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:54:26,820 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:54:26,820 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:54:26,820 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:54:26,820 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:54:26,820 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:54:26,820 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:54:26,820 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration19_Lasso [2020-11-30 00:54:26,820 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:54:26,820 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:54:26,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:26,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:26,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:26,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:26,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:26,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:26,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:26,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:26,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:26,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:26,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:32,165 WARN L193 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 193 DAG size of output: 150 [2020-11-30 00:54:33,039 WARN L193 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 105 [2020-11-30 00:54:33,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:54:33,508 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2020-11-30 00:54:33,789 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-30 00:54:34,492 WARN L193 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2020-11-30 00:54:35,142 WARN L193 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2020-11-30 00:54:35,631 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2020-11-30 00:54:36,998 WARN L193 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2020-11-30 00:54:37,441 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-11-30 00:54:37,648 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-11-30 00:54:37,850 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:54:37,850 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 108 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:54:37,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:54:37,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:54:37,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:54:37,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:54:37,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:54:37,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:54:37,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:54:37,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 108 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:54:37,878 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 109 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 109 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:54:37,914 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 [2020-11-30 00:54:37,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:54:37,915 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:54:37,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:54:37,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:54:37,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:54:37,916 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:54:37,916 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:54:37,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 110 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 110 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:54:37,944 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 [2020-11-30 00:54:37,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:54:37,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:54:37,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:54:37,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:54:37,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:54:37,947 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:54:37,947 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:54:37,948 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 111 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 111 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:54:37,976 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 [2020-11-30 00:54:37,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:54:37,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:54:37,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:54:37,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:54:37,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:54:37,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:54:37,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:54:37,980 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 112 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 112 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:54:38,007 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 [2020-11-30 00:54:38,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:54:38,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:54:38,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:54:38,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:54:38,010 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:54:38,010 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:54:38,014 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 113 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 113 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:54:38,042 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 [2020-11-30 00:54:38,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:54:38,043 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:54:38,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:54:38,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:54:38,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:54:38,044 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:54:38,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:54:38,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 114 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 114 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:54:38,072 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 [2020-11-30 00:54:38,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:54:38,073 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:54:38,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:54:38,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:54:38,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:54:38,074 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:54:38,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:54:38,075 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 115 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 115 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:54:38,104 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 [2020-11-30 00:54:38,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:54:38,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:54:38,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:54:38,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:54:38,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:54:38,107 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:54:38,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:54:38,111 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 116 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 116 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:54:38,140 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 [2020-11-30 00:54:38,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:54:38,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:54:38,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:54:38,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:54:38,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:54:38,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:54:38,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:54:38,144 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 117 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 117 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:54:38,172 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 [2020-11-30 00:54:38,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:54:38,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:54:38,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:54:38,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:54:38,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:54:38,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:54:38,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:54:38,176 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 118 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 118 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:54:38,203 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 [2020-11-30 00:54:38,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:54:38,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:54:38,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:54:38,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:54:38,206 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:54:38,207 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:54:38,210 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 119 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 119 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:54:38,237 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 [2020-11-30 00:54:38,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:54:38,238 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-11-30 00:54:38,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:54:38,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:54:38,240 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-11-30 00:54:38,240 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:54:38,244 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 120 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 120 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:54:38,274 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 [2020-11-30 00:54:38,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:54:38,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:54:38,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:54:38,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:54:38,280 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:54:38,280 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:54:38,285 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 121 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 121 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:54:38,313 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 [2020-11-30 00:54:38,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:54:38,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:54:38,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:54:38,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:54:38,345 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:54:38,346 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:54:38,371 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 122 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:54:38,418 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 [2020-11-30 00:54:38,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:54:38,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:54:38,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:54:38,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:54:38,423 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:54:38,423 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 122 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:54:38,428 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 123 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:54:38,474 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 [2020-11-30 00:54:38,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:54:38,478 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2020-11-30 00:54:38,478 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-11-30 00:54:38,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 123 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:54:38,535 INFO L401 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2020-11-30 00:54:38,536 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-11-30 00:54:38,612 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 124 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:54:38,664 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 [2020-11-30 00:54:38,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:54:38,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:54:38,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:54:38,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:54:38,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:54:38,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 124 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:54:38,680 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 125 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:54:38,730 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 [2020-11-30 00:54:38,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:54:38,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:54:38,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:54:38,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:54:38,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:54:38,735 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 125 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:54:38,739 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 126 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:54:38,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:54:38,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:54:38,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:54:38,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:54:38,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 126 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:54:38,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:54:38,829 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:54:38,896 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:54:39,021 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2020-11-30 00:54:39,021 INFO L444 ModelExtractionUtils]: 48 out of 88 variables were initially zero. Simplification set additionally 35 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d51c432-0b56-46ce-988f-a766bac88b53/bin/uautomizer/z3 Starting monitored process 127 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:54:39,026 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 127 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:54:39,030 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-11-30 00:54:39,030 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:54:39,030 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~n, v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_7) = 2*ULTIMATE.start_cstrncmp_~n + 3*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_7 Supporting invariants [3*ULTIMATE.start_cstrncmp_~s1.offset + 2*ULTIMATE.start_cstrncmp_~n >= 0] [2020-11-30 00:54:39,964 INFO L297 tatePredicateManager]: 80 out of 83 supporting invariants were superfluous and have been removed [2020-11-30 00:54:39,979 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-30 00:54:40,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:54:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:54:40,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 33 conjunts are in the unsatisfiable core [2020-11-30 00:54:40,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:54:40,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:54:40,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:54:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:54:40,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 16 conjunts are in the unsatisfiable core [2020-11-30 00:54:40,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:54:41,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:54:41,148 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.11 stem predicates 4 loop predicates [2020-11-30 00:54:41,149 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 164 states and 187 transitions. cyclomatic complexity: 35 Second operand 15 states. [2020-11-30 00:54:42,402 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 164 states and 187 transitions. cyclomatic complexity: 35. Second operand 15 states. Result 213 states and 245 transitions. Complement of second has 20 states. [2020-11-30 00:54:42,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 11 stem states 3 non-accepting loop states 2 accepting loop states [2020-11-30 00:54:42,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-11-30 00:54:42,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 56 transitions. [2020-11-30 00:54:42,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 56 transitions. Stem has 52 letters. Loop has 5 letters. [2020-11-30 00:54:42,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:54:42,407 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-11-30 00:54:42,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:54:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:54:42,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 33 conjunts are in the unsatisfiable core [2020-11-30 00:54:42,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:54:42,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:54:42,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:54:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:54:43,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 16 conjunts are in the unsatisfiable core [2020-11-30 00:54:43,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:54:43,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:54:43,416 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.11 stem predicates 4 loop predicates [2020-11-30 00:54:43,416 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 164 states and 187 transitions. cyclomatic complexity: 35 Second operand 15 states. [2020-11-30 00:54:44,739 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 164 states and 187 transitions. cyclomatic complexity: 35. Second operand 15 states. Result 212 states and 243 transitions. Complement of second has 20 states. [2020-11-30 00:54:44,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 11 stem states 3 non-accepting loop states 2 accepting loop states [2020-11-30 00:54:44,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-11-30 00:54:44,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 55 transitions. [2020-11-30 00:54:44,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 55 transitions. Stem has 52 letters. Loop has 5 letters. [2020-11-30 00:54:44,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:54:44,742 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-11-30 00:54:44,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:54:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:54:44,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 33 conjunts are in the unsatisfiable core [2020-11-30 00:54:44,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:54:45,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:54:45,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:54:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:54:45,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 16 conjunts are in the unsatisfiable core [2020-11-30 00:54:45,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:54:45,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:54:45,740 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.11 stem predicates 4 loop predicates [2020-11-30 00:54:45,740 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 164 states and 187 transitions. cyclomatic complexity: 35 Second operand 15 states. [2020-11-30 00:54:46,890 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 164 states and 187 transitions. cyclomatic complexity: 35. Second operand 15 states. Result 262 states and 299 transitions. Complement of second has 24 states. [2020-11-30 00:54:46,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 11 stem states 3 non-accepting loop states 2 accepting loop states [2020-11-30 00:54:46,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-11-30 00:54:46,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 89 transitions. [2020-11-30 00:54:46,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 89 transitions. Stem has 52 letters. Loop has 5 letters. [2020-11-30 00:54:46,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:54:46,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 89 transitions. Stem has 57 letters. Loop has 5 letters. [2020-11-30 00:54:46,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:54:46,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 89 transitions. Stem has 52 letters. Loop has 10 letters. [2020-11-30 00:54:46,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:54:46,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 262 states and 299 transitions. [2020-11-30 00:54:46,906 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-30 00:54:46,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 262 states to 0 states and 0 transitions. [2020-11-30 00:54:46,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-30 00:54:46,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-30 00:54:46,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-30 00:54:46,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:54:46,907 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 00:54:46,908 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 00:54:46,908 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 00:54:46,908 INFO L427 BuchiCegarLoop]: ======== Iteration 20============ [2020-11-30 00:54:46,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-11-30 00:54:46,908 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-30 00:54:46,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-11-30 00:54:46,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 30.11 12:54:46 BoogieIcfgContainer [2020-11-30 00:54:46,917 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-30 00:54:46,917 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:54:46,918 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:54:46,918 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:54:46,919 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:51:33" (3/4) ... [2020-11-30 00:54:46,923 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-30 00:54:46,923 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:54:46,924 INFO L168 Benchmark]: Toolchain (without parser) took 194928.03 ms. Allocated memory was 94.4 MB in the beginning and 360.7 MB in the end (delta: 266.3 MB). Free memory was 63.3 MB in the beginning and 268.4 MB in the end (delta: -205.1 MB). Peak memory consumption was 61.3 MB. Max. memory is 16.1 GB. [2020-11-30 00:54:46,924 INFO L168 Benchmark]: CDTParser took 0.77 ms. Allocated memory is still 94.4 MB. Free memory was 53.1 MB in the beginning and 53.1 MB in the end (delta: 65.0 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:54:46,925 INFO L168 Benchmark]: CACSL2BoogieTranslator took 556.65 ms. Allocated memory is still 94.4 MB. Free memory was 62.9 MB in the beginning and 60.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:54:46,925 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.95 ms. Allocated memory is still 94.4 MB. Free memory was 60.6 MB in the beginning and 58.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:54:46,925 INFO L168 Benchmark]: Boogie Preprocessor took 86.48 ms. Allocated memory is still 94.4 MB. Free memory was 58.0 MB in the beginning and 56.6 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:54:46,925 INFO L168 Benchmark]: RCFGBuilder took 620.05 ms. Allocated memory is still 94.4 MB. Free memory was 56.6 MB in the beginning and 33.4 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:54:46,926 INFO L168 Benchmark]: BuchiAutomizer took 193602.44 ms. Allocated memory was 94.4 MB in the beginning and 360.7 MB in the end (delta: 266.3 MB). Free memory was 33.4 MB in the beginning and 268.4 MB in the end (delta: -235.0 MB). Peak memory consumption was 34.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:54:46,926 INFO L168 Benchmark]: Witness Printer took 5.34 ms. Allocated memory is still 360.7 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:54:46,928 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.77 ms. Allocated memory is still 94.4 MB. Free memory was 53.1 MB in the beginning and 53.1 MB in the end (delta: 65.0 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 556.65 ms. Allocated memory is still 94.4 MB. Free memory was 62.9 MB in the beginning and 60.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 50.95 ms. Allocated memory is still 94.4 MB. Free memory was 60.6 MB in the beginning and 58.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 86.48 ms. Allocated memory is still 94.4 MB. Free memory was 58.0 MB in the beginning and 56.6 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 620.05 ms. Allocated memory is still 94.4 MB. Free memory was 56.6 MB in the beginning and 33.4 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 193602.44 ms. Allocated memory was 94.4 MB in the beginning and 360.7 MB in the end (delta: 266.3 MB). Free memory was 33.4 MB in the beginning and 268.4 MB in the end (delta: -235.0 MB). Peak memory consumption was 34.4 MB. Max. memory is 16.1 GB. * Witness Printer took 5.34 ms. Allocated memory is still 360.7 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 19 terminating modules (12 trivial, 6 deterministic, 1 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * i + length2 and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 5 locations. One deterministic module has affine ranking function -1 * s + length1 and consists of 5 locations. One deterministic module has affine ranking function 4 * unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -3 * s2 and consists of 17 locations. One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[nondetString1] and consists of 7 locations. One nondeterministic module has affine ranking function 2 * n + 3 * unknown-#length-unknown[nondetString1] and consists of 16 locations. 12 modules have a trivial ranking function, the largest among these consists of 37 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 193.5s and 20 iterations. TraceHistogramMax:5. Analysis of lassos took 146.3s. Construction of modules took 23.9s. Büchi inclusion checks took 22.7s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 12. Automata minimization 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 441 StatesRemovedByMinimization, 14 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 164 states and ocurred in iteration 18. Nontrivial modules had stage [6, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 744 SDtfs, 2864 SDslu, 4229 SDs, 0 SdLazy, 3300 SolverSat, 388 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 23.9s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc6 concLT0 SILN0 SILU5 SILI0 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital429 mio100 ax106 hnf98 lsp91 ukn62 mio100 lsp54 div108 bol100 ite100 ukn100 eq188 hnf83 smp94 dnf119 smp92 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 149ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 56 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...