./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-regression/ex3_forlist.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 63182f13 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-regression/ex3_forlist.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y --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 33fdb29d081e8788960943f1182fbfb10ca7dcdfe7c31b22aaab16bda45fd1b8 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-63182f1 [2021-11-13 18:39:09,279 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-13 18:39:09,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-13 18:39:09,314 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-13 18:39:09,315 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-13 18:39:09,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-13 18:39:09,318 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-13 18:39:09,320 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-13 18:39:09,322 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-13 18:39:09,323 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-13 18:39:09,324 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-13 18:39:09,325 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-13 18:39:09,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-13 18:39:09,327 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-13 18:39:09,329 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-13 18:39:09,330 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-13 18:39:09,334 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-13 18:39:09,336 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-13 18:39:09,341 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-13 18:39:09,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-13 18:39:09,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-13 18:39:09,352 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-13 18:39:09,359 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-13 18:39:09,360 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-13 18:39:09,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-13 18:39:09,367 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-13 18:39:09,368 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-13 18:39:09,369 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-13 18:39:09,370 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-13 18:39:09,371 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-13 18:39:09,373 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-13 18:39:09,374 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-13 18:39:09,375 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-13 18:39:09,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-13 18:39:09,378 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-13 18:39:09,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-13 18:39:09,380 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-13 18:39:09,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-13 18:39:09,380 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-13 18:39:09,381 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-13 18:39:09,382 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-13 18:39:09,383 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-11-13 18:39:09,433 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-13 18:39:09,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-13 18:39:09,437 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-13 18:39:09,437 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-13 18:39:09,439 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-13 18:39:09,439 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-13 18:39:09,439 INFO L138 SettingsManager]: * Use SBE=true [2021-11-13 18:39:09,440 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-11-13 18:39:09,440 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-11-13 18:39:09,440 INFO L138 SettingsManager]: * Use old map elimination=false [2021-11-13 18:39:09,441 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-11-13 18:39:09,441 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-11-13 18:39:09,442 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-11-13 18:39:09,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-13 18:39:09,442 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-13 18:39:09,442 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-13 18:39:09,443 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-13 18:39:09,443 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-13 18:39:09,443 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-13 18:39:09,443 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-11-13 18:39:09,444 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-11-13 18:39:09,444 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-11-13 18:39:09,444 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-13 18:39:09,444 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-13 18:39:09,445 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-11-13 18:39:09,445 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-13 18:39:09,446 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-11-13 18:39:09,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-13 18:39:09,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-13 18:39:09,447 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-13 18:39:09,447 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-13 18:39:09,448 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-13 18:39:09,449 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-11-13 18:39:09,449 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_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/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_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y 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 -> 33fdb29d081e8788960943f1182fbfb10ca7dcdfe7c31b22aaab16bda45fd1b8 [2021-11-13 18:39:09,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-13 18:39:09,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-13 18:39:09,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-13 18:39:09,749 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-13 18:39:09,751 INFO L275 PluginConnector]: CDTParser initialized [2021-11-13 18:39:09,752 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/../../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2021-11-13 18:39:09,831 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/data/2040b0540/aef3e3cb4f2f4bf7bc2f7a1ea808b7a1/FLAGe4a86beaa [2021-11-13 18:39:10,268 INFO L306 CDTParser]: Found 1 translation units. [2021-11-13 18:39:10,268 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2021-11-13 18:39:10,275 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/data/2040b0540/aef3e3cb4f2f4bf7bc2f7a1ea808b7a1/FLAGe4a86beaa [2021-11-13 18:39:10,288 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/data/2040b0540/aef3e3cb4f2f4bf7bc2f7a1ea808b7a1 [2021-11-13 18:39:10,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-13 18:39:10,292 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-13 18:39:10,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-13 18:39:10,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-13 18:39:10,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-13 18:39:10,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 06:39:10" (1/1) ... [2021-11-13 18:39:10,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c519fad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:39:10, skipping insertion in model container [2021-11-13 18:39:10,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 06:39:10" (1/1) ... [2021-11-13 18:39:10,306 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-13 18:39:10,320 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-13 18:39:10,488 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2021-11-13 18:39:10,526 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 18:39:10,536 INFO L203 MainTranslator]: Completed pre-run [2021-11-13 18:39:10,548 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2021-11-13 18:39:10,557 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 18:39:10,576 INFO L208 MainTranslator]: Completed translation [2021-11-13 18:39:10,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:39:10 WrapperNode [2021-11-13 18:39:10,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-13 18:39:10,579 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-13 18:39:10,579 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-13 18:39:10,580 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-13 18:39:10,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:39:10" (1/1) ... [2021-11-13 18:39:10,609 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:39:10" (1/1) ... [2021-11-13 18:39:10,647 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-13 18:39:10,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-13 18:39:10,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-13 18:39:10,649 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-13 18:39:10,657 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:39:10" (1/1) ... [2021-11-13 18:39:10,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:39:10" (1/1) ... [2021-11-13 18:39:10,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:39:10" (1/1) ... [2021-11-13 18:39:10,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:39:10" (1/1) ... [2021-11-13 18:39:10,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:39:10" (1/1) ... [2021-11-13 18:39:10,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:39:10" (1/1) ... [2021-11-13 18:39:10,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:39:10" (1/1) ... [2021-11-13 18:39:10,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-13 18:39:10,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-13 18:39:10,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-13 18:39:10,709 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-13 18:39:10,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:39:10" (1/1) ... [2021-11-13 18:39:10,718 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:39:10,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:39:10,744 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:39:10,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-11-13 18:39:10,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-13 18:39:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-13 18:39:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-13 18:39:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-13 18:39:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-13 18:39:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-13 18:39:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-13 18:39:10,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-13 18:39:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-13 18:39:11,141 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-13 18:39:11,141 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-11-13 18:39:11,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 06:39:11 BoogieIcfgContainer [2021-11-13 18:39:11,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-13 18:39:11,144 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-11-13 18:39:11,144 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-11-13 18:39:11,148 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-11-13 18:39:11,149 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-13 18:39:11,149 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.11 06:39:10" (1/3) ... [2021-11-13 18:39:11,150 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26498735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 06:39:11, skipping insertion in model container [2021-11-13 18:39:11,150 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-13 18:39:11,150 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:39:10" (2/3) ... [2021-11-13 18:39:11,151 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26498735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 06:39:11, skipping insertion in model container [2021-11-13 18:39:11,151 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-13 18:39:11,151 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 06:39:11" (3/3) ... [2021-11-13 18:39:11,152 INFO L388 chiAutomizerObserver]: Analyzing ICFG ex3_forlist.i [2021-11-13 18:39:11,209 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-11-13 18:39:11,210 INFO L360 BuchiCegarLoop]: Hoare is false [2021-11-13 18:39:11,210 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-11-13 18:39:11,210 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-11-13 18:39:11,210 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-11-13 18:39:11,210 INFO L364 BuchiCegarLoop]: Difference is false [2021-11-13 18:39:11,210 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-11-13 18:39:11,211 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-11-13 18:39:11,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:39:11,246 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 22 [2021-11-13 18:39:11,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 18:39:11,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 18:39:11,270 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-13 18:39:11,270 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-13 18:39:11,270 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-11-13 18:39:11,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:39:11,279 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 22 [2021-11-13 18:39:11,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 18:39:11,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 18:39:11,280 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-13 18:39:11,280 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-13 18:39:11,302 INFO L791 eck$LassoCheckResult]: Stem: 19#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~ret15#1.base, main_#t~ret15#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post7#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 36#L19-3true [2021-11-13 18:39:11,303 INFO L793 eck$LassoCheckResult]: Loop: 36#L19-3true assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 3#L19-2true init_#t~post7#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post7#1;havoc init_#t~post7#1; 36#L19-3true [2021-11-13 18:39:11,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:39:11,319 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-11-13 18:39:11,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:39:11,328 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85487595] [2021-11-13 18:39:11,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:39:11,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:39:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:39:11,457 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 18:39:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:39:11,526 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 18:39:11,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:39:11,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-11-13 18:39:11,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:39:11,530 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698318542] [2021-11-13 18:39:11,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:39:11,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:39:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:39:11,570 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 18:39:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:39:11,590 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 18:39:11,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:39:11,600 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-11-13 18:39:11,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:39:11,601 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285184548] [2021-11-13 18:39:11,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:39:11,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:39:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:39:11,653 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 18:39:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:39:11,720 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 18:39:12,953 INFO L210 LassoAnalysis]: Preferences: [2021-11-13 18:39:12,953 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-13 18:39:12,954 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-13 18:39:12,954 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-13 18:39:12,954 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-13 18:39:12,955 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:39:12,955 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-13 18:39:12,955 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-13 18:39:12,955 INFO L133 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration1_Lasso [2021-11-13 18:39:12,955 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-13 18:39:12,955 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-13 18:39:12,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:39:12,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:39:12,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:39:13,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:39:13,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:39:13,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:39:13,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:39:13,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:39:13,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:39:13,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:39:13,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:39:13,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:39:13,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:39:13,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:39:13,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:39:13,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:39:13,935 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-13 18:39:13,939 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-13 18:39:13,941 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:39:13,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:39:13,943 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:39:13,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-11-13 18:39:13,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:39:13,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:39:13,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-13 18:39:13,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:39:13,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:39:13,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:39:13,971 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-13 18:39:13,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-13 18:39:13,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:39:14,031 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-11-13 18:39:14,031 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:39:14,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:39:14,033 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:39:14,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:39:14,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:39:14,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:39:14,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:39:14,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:39:14,055 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 18:39:14,056 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 18:39:14,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-11-13 18:39:14,070 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:39:14,106 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-11-13 18:39:14,106 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:39:14,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:39:14,108 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:39:14,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-11-13 18:39:14,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:39:14,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:39:14,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-13 18:39:14,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:39:14,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:39:14,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:39:14,125 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-13 18:39:14,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-13 18:39:14,138 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:39:14,170 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2021-11-13 18:39:14,171 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:39:14,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:39:14,172 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:39:14,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-11-13 18:39:14,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:39:14,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:39:14,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-13 18:39:14,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:39:14,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:39:14,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:39:14,187 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-13 18:39:14,187 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-13 18:39:14,188 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:39:14,209 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2021-11-13 18:39:14,210 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:39:14,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:39:14,211 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:39:14,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-11-13 18:39:14,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:39:14,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:39:14,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:39:14,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:39:14,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:39:14,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 18:39:14,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 18:39:14,250 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:39:14,290 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2021-11-13 18:39:14,290 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:39:14,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:39:14,291 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:39:14,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:39:14,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-11-13 18:39:14,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:39:14,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-13 18:39:14,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:39:14,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:39:14,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:39:14,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-13 18:39:14,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-13 18:39:14,329 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:39:14,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-11-13 18:39:14,352 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:39:14,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:39:14,353 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:39:14,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-11-13 18:39:14,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:39:14,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:39:14,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-13 18:39:14,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:39:14,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:39:14,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:39:14,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-13 18:39:14,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-13 18:39:14,365 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:39:14,386 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-11-13 18:39:14,386 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:39:14,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:39:14,387 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:39:14,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-11-13 18:39:14,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:39:14,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:39:14,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-13 18:39:14,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:39:14,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:39:14,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:39:14,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-13 18:39:14,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-13 18:39:14,422 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:39:14,454 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-11-13 18:39:14,455 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:39:14,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:39:14,456 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:39:14,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:39:14,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:39:14,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:39:14,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:39:14,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:39:14,475 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 18:39:14,475 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 18:39:14,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-11-13 18:39:14,498 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:39:14,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-11-13 18:39:14,519 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:39:14,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:39:14,520 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:39:14,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-11-13 18:39:14,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:39:14,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:39:14,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:39:14,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:39:14,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:39:14,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 18:39:14,537 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 18:39:14,562 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:39:14,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-11-13 18:39:14,594 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:39:14,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:39:14,595 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:39:14,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:39:14,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:39:14,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:39:14,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:39:14,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:39:14,619 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 18:39:14,619 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 18:39:14,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-11-13 18:39:14,650 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-13 18:39:14,707 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2021-11-13 18:39:14,707 INFO L444 ModelExtractionUtils]: 0 out of 22 variables were initially zero. Simplification set additionally 19 variables to zero. [2021-11-13 18:39:14,709 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:39:14,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:39:14,721 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:39:14,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-11-13 18:39:14,744 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-13 18:39:14,779 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-13 18:39:14,779 INFO L513 LassoAnalysis]: Proved termination. [2021-11-13 18:39:14,780 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_~i~0#1) = -2*ULTIMATE.start_init_~i~0#1 + 3 Supporting invariants [] [2021-11-13 18:39:14,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-11-13 18:39:14,941 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2021-11-13 18:39:14,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:39:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:39:15,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-13 18:39:15,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:39:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:39:15,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-13 18:39:15,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:39:15,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:39:15,073 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 [2021-11-13 18:39:15,074 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:39:15,151 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 95 states and 138 transitions. Complement of second has 7 states. [2021-11-13 18:39:15,153 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 [2021-11-13 18:39:15,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:39:15,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2021-11-13 18:39:15,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 2 letters. Loop has 2 letters. [2021-11-13 18:39:15,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-13 18:39:15,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 4 letters. Loop has 2 letters. [2021-11-13 18:39:15,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-13 18:39:15,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 2 letters. Loop has 4 letters. [2021-11-13 18:39:15,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-13 18:39:15,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 138 transitions. [2021-11-13 18:39:15,175 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-11-13 18:39:15,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 28 states and 37 transitions. [2021-11-13 18:39:15,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-11-13 18:39:15,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2021-11-13 18:39:15,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2021-11-13 18:39:15,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 18:39:15,181 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-11-13 18:39:15,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2021-11-13 18:39:15,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-11-13 18:39:15,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:39:15,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2021-11-13 18:39:15,208 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-11-13 18:39:15,208 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-11-13 18:39:15,208 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-11-13 18:39:15,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2021-11-13 18:39:15,210 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-11-13 18:39:15,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 18:39:15,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 18:39:15,210 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-13 18:39:15,210 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-13 18:39:15,211 INFO L791 eck$LassoCheckResult]: Stem: 282#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 270#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~ret15#1.base, main_#t~ret15#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post7#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 271#L19-3 assume !(init_~i~0#1 < 2); 286#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post13#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post13#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post13#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post13#1;havoc malloc_#t~post13#1; 277#L49 main_#t~ret14#1.base, main_#t~ret14#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post13#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post13#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post13#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post13#1;havoc malloc_#t~post13#1; 273#L49-1 main_#t~ret15#1.base, main_#t~ret15#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret15#1.base, main_#t~ret15#1.offset;havoc main_#t~ret15#1.base, main_#t~ret15#1.offset; 266#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset, f_#t~post8#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 267#L27-3 [2021-11-13 18:39:15,211 INFO L793 eck$LassoCheckResult]: Loop: 267#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem9#1.base, f_#t~mem9#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 288#L28 assume !(f_#t~mem9#1.base == 0 && f_#t~mem9#1.offset == 0);havoc f_#t~mem9#1.base, f_#t~mem9#1.offset; 272#L27-2 f_#t~post8#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post8#1;havoc f_#t~post8#1; 267#L27-3 [2021-11-13 18:39:15,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:39:15,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1807951404, now seen corresponding path program 1 times [2021-11-13 18:39:15,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:39:15,212 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994340305] [2021-11-13 18:39:15,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:39:15,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:39:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:39:15,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:39:15,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:39:15,253 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994340305] [2021-11-13 18:39:15,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994340305] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:39:15,254 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:39:15,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 18:39:15,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208507871] [2021-11-13 18:39:15,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:39:15,257 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-13 18:39:15,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:39:15,258 INFO L85 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 1 times [2021-11-13 18:39:15,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:39:15,258 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797384016] [2021-11-13 18:39:15,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:39:15,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:39:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:39:15,263 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 18:39:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:39:15,268 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 18:39:15,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:39:15,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 18:39:15,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-13 18:39:15,372 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:39:15,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-11-13 18:39:15,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:39:15,392 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2021-11-13 18:39:15,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 18:39:15,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2021-11-13 18:39:15,395 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-11-13 18:39:15,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2021-11-13 18:39:15,396 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2021-11-13 18:39:15,396 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2021-11-13 18:39:15,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2021-11-13 18:39:15,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 18:39:15,396 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2021-11-13 18:39:15,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2021-11-13 18:39:15,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-11-13 18:39:15,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:39:15,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2021-11-13 18:39:15,399 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2021-11-13 18:39:15,399 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2021-11-13 18:39:15,399 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-11-13 18:39:15,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2021-11-13 18:39:15,400 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-11-13 18:39:15,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 18:39:15,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 18:39:15,401 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 18:39:15,401 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-13 18:39:15,401 INFO L791 eck$LassoCheckResult]: Stem: 345#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 333#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~ret15#1.base, main_#t~ret15#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post7#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 334#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 324#L19-2 init_#t~post7#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post7#1;havoc init_#t~post7#1; 325#L19-3 assume !(init_~i~0#1 < 2); 349#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post13#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post13#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post13#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post13#1;havoc malloc_#t~post13#1; 337#L49 main_#t~ret14#1.base, main_#t~ret14#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post13#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post13#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post13#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post13#1;havoc malloc_#t~post13#1; 336#L49-1 main_#t~ret15#1.base, main_#t~ret15#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret15#1.base, main_#t~ret15#1.offset;havoc main_#t~ret15#1.base, main_#t~ret15#1.offset; 326#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset, f_#t~post8#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 327#L27-3 [2021-11-13 18:39:15,401 INFO L793 eck$LassoCheckResult]: Loop: 327#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem9#1.base, f_#t~mem9#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 351#L28 assume !(f_#t~mem9#1.base == 0 && f_#t~mem9#1.offset == 0);havoc f_#t~mem9#1.base, f_#t~mem9#1.offset; 335#L27-2 f_#t~post8#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post8#1;havoc f_#t~post8#1; 327#L27-3 [2021-11-13 18:39:15,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:39:15,402 INFO L85 PathProgramCache]: Analyzing trace with hash -369325334, now seen corresponding path program 1 times [2021-11-13 18:39:15,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:39:15,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116304663] [2021-11-13 18:39:15,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:39:15,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:39:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:39:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:39:15,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:39:15,436 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116304663] [2021-11-13 18:39:15,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116304663] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:39:15,437 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963786132] [2021-11-13 18:39:15,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:39:15,437 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:39:15,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:39:15,438 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:39:15,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-13 18:39:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:39:15,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-13 18:39:15,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:39:15,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:39:15,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 18:39:15,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:39:15,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963786132] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 18:39:15,556 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 18:39:15,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-11-13 18:39:15,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248453525] [2021-11-13 18:39:15,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 18:39:15,556 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-13 18:39:15,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:39:15,557 INFO L85 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 2 times [2021-11-13 18:39:15,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:39:15,557 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214738120] [2021-11-13 18:39:15,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:39:15,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:39:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:39:15,561 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 18:39:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:39:15,566 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 18:39:15,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:39:15,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 18:39:15,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-13 18:39:15,611 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 13 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:39:15,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:39:15,630 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2021-11-13 18:39:15,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 18:39:15,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2021-11-13 18:39:15,632 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-11-13 18:39:15,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2021-11-13 18:39:15,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2021-11-13 18:39:15,633 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2021-11-13 18:39:15,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2021-11-13 18:39:15,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 18:39:15,634 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2021-11-13 18:39:15,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2021-11-13 18:39:15,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-11-13 18:39:15,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:39:15,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2021-11-13 18:39:15,637 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2021-11-13 18:39:15,637 INFO L587 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2021-11-13 18:39:15,637 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-11-13 18:39:15,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2021-11-13 18:39:15,638 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-11-13 18:39:15,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 18:39:15,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 18:39:15,638 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 18:39:15,639 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-13 18:39:15,639 INFO L791 eck$LassoCheckResult]: Stem: 459#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 445#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~ret15#1.base, main_#t~ret15#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post7#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 446#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 438#L19-2 init_#t~post7#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post7#1;havoc init_#t~post7#1; 439#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 466#L19-2 init_#t~post7#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post7#1;havoc init_#t~post7#1; 467#L19-3 assume !(init_~i~0#1 < 2); 463#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post13#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post13#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post13#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post13#1;havoc malloc_#t~post13#1; 451#L49 main_#t~ret14#1.base, main_#t~ret14#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post13#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post13#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post13#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post13#1;havoc malloc_#t~post13#1; 450#L49-1 main_#t~ret15#1.base, main_#t~ret15#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret15#1.base, main_#t~ret15#1.offset;havoc main_#t~ret15#1.base, main_#t~ret15#1.offset; 440#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset, f_#t~post8#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 441#L27-3 [2021-11-13 18:39:15,639 INFO L793 eck$LassoCheckResult]: Loop: 441#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem9#1.base, f_#t~mem9#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 465#L28 assume !(f_#t~mem9#1.base == 0 && f_#t~mem9#1.offset == 0);havoc f_#t~mem9#1.base, f_#t~mem9#1.offset; 449#L27-2 f_#t~post8#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post8#1;havoc f_#t~post8#1; 441#L27-3 [2021-11-13 18:39:15,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:39:15,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1083197400, now seen corresponding path program 2 times [2021-11-13 18:39:15,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:39:15,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501724862] [2021-11-13 18:39:15,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:39:15,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:39:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:39:15,668 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 18:39:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:39:15,712 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 18:39:15,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:39:15,721 INFO L85 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 3 times [2021-11-13 18:39:15,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:39:15,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579069909] [2021-11-13 18:39:15,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:39:15,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:39:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:39:15,732 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 18:39:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:39:15,737 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 18:39:15,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:39:15,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1444415621, now seen corresponding path program 1 times [2021-11-13 18:39:15,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:39:15,740 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950668547] [2021-11-13 18:39:15,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:39:15,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:39:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:39:16,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:39:16,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:39:16,070 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950668547] [2021-11-13 18:39:16,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950668547] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:39:16,071 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810435129] [2021-11-13 18:39:16,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:39:16,071 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:39:16,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:39:16,072 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:39:16,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-13 18:39:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:39:16,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-13 18:39:16,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:39:16,191 INFO L388 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 313 treesize of output 309 [2021-11-13 18:39:16,288 INFO L388 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 47 treesize of output 11 [2021-11-13 18:39:16,299 INFO L388 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 47 treesize of output 11 [2021-11-13 18:39:16,421 INFO L354 Elim1Store]: treesize reduction 126, result has 13.1 percent of original size [2021-11-13 18:39:16,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 83 [2021-11-13 18:39:16,470 INFO L354 Elim1Store]: treesize reduction 126, result has 13.1 percent of original size [2021-11-13 18:39:16,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 47 [2021-11-13 18:39:16,783 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-13 18:39:16,784 INFO L388 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 62 treesize of output 46 [2021-11-13 18:39:16,793 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-13 18:39:16,793 INFO L388 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 40 treesize of output 24 [2021-11-13 18:39:16,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:39:16,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 18:39:29,025 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_init_~i~0#1_113| Int)) (or (< |v_ULTIMATE.start_init_~i~0#1_113| (+ |c_ULTIMATE.start_init_~i~0#1| 1)) (and (forall ((v_DerPreprocessor_4 Int)) (= (select (select (let ((.cse1 (* |v_ULTIMATE.start_init_~i~0#1_113| 4))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ .cse1 |c_~#pp~0.offset|) 0)))) (store .cse0 |c_~#pstate~0.base| (store (select .cse0 |c_~#pstate~0.base|) (+ .cse1 |c_~#pstate~0.offset|) v_DerPreprocessor_4)))) |c_~#pp~0.base|) |c_~#pp~0.offset|) 0)) (forall ((v_DerPreprocessor_3 Int)) (= (select (select (let ((.cse3 (* |v_ULTIMATE.start_init_~i~0#1_113| 4))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ .cse3 |c_~#pp~0.offset|) 0)))) (store .cse2 |c_~#pstate~0.base| (store (select .cse2 |c_~#pstate~0.base|) (+ .cse3 |c_~#pstate~0.offset|) v_DerPreprocessor_3)))) |c_~#pp~0.base|) |c_~#pp~0.offset|) 0))))) is different from false [2021-11-13 18:39:29,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11528 treesize of output 11400 [2021-11-13 18:39:30,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19259 treesize of output 19131 [2021-11-13 18:39:31,654 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-13 18:39:31,654 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-13 18:39:31,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2021-11-13 18:39:31,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049753716] [2021-11-13 18:39:31,654 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-13 18:39:31,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:39:31,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-13 18:39:31,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=184, Unknown=1, NotChecked=28, Total=272 [2021-11-13 18:39:31,707 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. cyclomatic complexity: 13 Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:39:31,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:39:31,917 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2021-11-13 18:39:31,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-13 18:39:31,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2021-11-13 18:39:31,918 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-11-13 18:39:31,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 35 transitions. [2021-11-13 18:39:31,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-11-13 18:39:31,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-11-13 18:39:31,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2021-11-13 18:39:31,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 18:39:31,919 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2021-11-13 18:39:31,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2021-11-13 18:39:31,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-11-13 18:39:31,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:39:31,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2021-11-13 18:39:31,921 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2021-11-13 18:39:31,921 INFO L587 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2021-11-13 18:39:31,921 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-11-13 18:39:31,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2021-11-13 18:39:31,922 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-11-13 18:39:31,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 18:39:31,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 18:39:31,922 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 18:39:31,922 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-13 18:39:31,923 INFO L791 eck$LassoCheckResult]: Stem: 619#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 608#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~ret15#1.base, main_#t~ret15#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post7#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 609#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 599#L19-2 init_#t~post7#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post7#1;havoc init_#t~post7#1; 600#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 626#L19-2 init_#t~post7#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post7#1;havoc init_#t~post7#1; 627#L19-3 assume !(init_~i~0#1 < 2); 623#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post13#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post13#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post13#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post13#1;havoc malloc_#t~post13#1; 614#L49 main_#t~ret14#1.base, main_#t~ret14#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post13#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post13#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post13#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post13#1;havoc malloc_#t~post13#1; 610#L49-1 main_#t~ret15#1.base, main_#t~ret15#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret15#1.base, main_#t~ret15#1.offset;havoc main_#t~ret15#1.base, main_#t~ret15#1.offset; 601#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset, f_#t~post8#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 602#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem9#1.base, f_#t~mem9#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 625#L28 assume f_#t~mem9#1.base == 0 && f_#t~mem9#1.offset == 0;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 621#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset, f_#t~post8#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 620#L27-7 [2021-11-13 18:39:31,923 INFO L793 eck$LassoCheckResult]: Loop: 620#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem9#1.base, f_#t~mem9#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 611#L28-1 assume !(f_#t~mem9#1.base == 0 && f_#t~mem9#1.offset == 0);havoc f_#t~mem9#1.base, f_#t~mem9#1.offset; 613#L27-6 f_#t~post8#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post8#1;havoc f_#t~post8#1; 620#L27-7 [2021-11-13 18:39:31,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:39:31,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1444415679, now seen corresponding path program 1 times [2021-11-13 18:39:31,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:39:31,924 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120994181] [2021-11-13 18:39:31,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:39:31,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:39:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:39:31,950 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 18:39:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:39:31,982 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 18:39:31,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:39:31,983 INFO L85 PathProgramCache]: Analyzing trace with hash 81589, now seen corresponding path program 1 times [2021-11-13 18:39:31,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:39:31,983 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075698232] [2021-11-13 18:39:31,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:39:31,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:39:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:39:31,987 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 18:39:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:39:31,990 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 18:39:31,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:39:31,991 INFO L85 PathProgramCache]: Analyzing trace with hash 689897333, now seen corresponding path program 1 times [2021-11-13 18:39:31,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:39:31,991 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001055911] [2021-11-13 18:39:31,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:39:31,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:39:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:39:32,021 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 18:39:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:39:32,059 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 18:39:56,665 WARN L227 SmtUtils]: Spent 24.54s on a formula simplification. DAG size of input: 317 DAG size of output: 262 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-13 18:40:04,734 WARN L227 SmtUtils]: Spent 7.59s on a formula simplification that was a NOOP. DAG size: 200 (called from [L 268] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-13 18:40:04,738 INFO L210 LassoAnalysis]: Preferences: [2021-11-13 18:40:04,738 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-13 18:40:04,738 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-13 18:40:04,738 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-13 18:40:04,738 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-13 18:40:04,738 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:40:04,738 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-13 18:40:04,738 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-13 18:40:04,738 INFO L133 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration5_Lasso [2021-11-13 18:40:04,738 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-13 18:40:04,738 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-13 18:40:04,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:40:04,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:40:04,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:40:04,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:40:09,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:40:09,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:40:09,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:40:09,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:40:09,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:40:09,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:40:09,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:40:09,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:40:09,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:40:09,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:40:09,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:40:09,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:40:09,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:40:09,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:40:10,001 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-13 18:40:10,001 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-13 18:40:10,002 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:40:10,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:40:10,004 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:40:10,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-11-13 18:40:10,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:40:10,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:40:10,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-13 18:40:10,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:40:10,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:40:10,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:40:10,016 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-13 18:40:10,016 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-13 18:40:10,034 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:40:10,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-11-13 18:40:10,073 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:40:10,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:40:10,074 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:40:10,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:40:10,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:40:10,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-13 18:40:10,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:40:10,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:40:10,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:40:10,092 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-13 18:40:10,092 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-13 18:40:10,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-11-13 18:40:10,114 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:40:10,149 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-11-13 18:40:10,149 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:40:10,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:40:10,150 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:40:10,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:40:10,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:40:10,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-13 18:40:10,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:40:10,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:40:10,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:40:10,168 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-13 18:40:10,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-13 18:40:10,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-11-13 18:40:10,182 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:40:10,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-11-13 18:40:10,208 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:40:10,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:40:10,208 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:40:10,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-11-13 18:40:10,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:40:10,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:40:10,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:40:10,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:40:10,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:40:10,222 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 18:40:10,222 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 18:40:10,236 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:40:10,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-11-13 18:40:10,271 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:40:10,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:40:10,271 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:40:10,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-11-13 18:40:10,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:40:10,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:40:10,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:40:10,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:40:10,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:40:10,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 18:40:10,295 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 18:40:10,297 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:40:10,321 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-11-13 18:40:10,321 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:40:10,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:40:10,323 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:40:10,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-11-13 18:40:10,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:40:10,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:40:10,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:40:10,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:40:10,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:40:10,336 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 18:40:10,336 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 18:40:10,346 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:40:10,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-11-13 18:40:10,365 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:40:10,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:40:10,366 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:40:10,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-11-13 18:40:10,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:40:10,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:40:10,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:40:10,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:40:10,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:40:10,379 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 18:40:10,379 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 18:40:10,390 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:40:10,411 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-11-13 18:40:10,411 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:40:10,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:40:10,412 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:40:10,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:40:10,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-11-13 18:40:10,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:40:10,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:40:10,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:40:10,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:40:10,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 18:40:10,425 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 18:40:10,427 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:40:10,445 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2021-11-13 18:40:10,445 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:40:10,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:40:10,446 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:40:10,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-11-13 18:40:10,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:40:10,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:40:10,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:40:10,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:40:10,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:40:10,457 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 18:40:10,457 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 18:40:10,460 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:40:10,478 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-11-13 18:40:10,479 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:40:10,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:40:10,479 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:40:10,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-11-13 18:40:10,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:40:10,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:40:10,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:40:10,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:40:10,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:40:10,490 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 18:40:10,490 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 18:40:10,494 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:40:10,512 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-11-13 18:40:10,513 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:40:10,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:40:10,513 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:40:10,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-11-13 18:40:10,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:40:10,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:40:10,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:40:10,522 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2021-11-13 18:40:10,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:40:10,582 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2021-11-13 18:40:10,582 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2021-11-13 18:40:10,662 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:40:10,684 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-11-13 18:40:10,684 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:40:10,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:40:10,685 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:40:10,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:40:10,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-11-13 18:40:10,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:40:10,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:40:10,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:40:10,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:40:10,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 18:40:10,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 18:40:10,698 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:40:10,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-11-13 18:40:10,721 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:40:10,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:40:10,721 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:40:10,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-11-13 18:40:10,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:40:10,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:40:10,731 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-13 18:40:10,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:40:10,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:40:10,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:40:10,733 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-13 18:40:10,733 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-13 18:40:10,734 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:40:10,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-11-13 18:40:10,752 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:40:10,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:40:10,753 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:40:10,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-11-13 18:40:10,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:40:10,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:40:10,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:40:10,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:40:10,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:40:10,765 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 18:40:10,766 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 18:40:10,776 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:40:10,812 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-11-13 18:40:10,812 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:40:10,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:40:10,813 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:40:10,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-11-13 18:40:10,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:40:10,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:40:10,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:40:10,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:40:10,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:40:10,832 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 18:40:10,832 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 18:40:10,846 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:40:10,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-11-13 18:40:10,880 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:40:10,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:40:10,883 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:40:10,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:40:10,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:40:10,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:40:10,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:40:10,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:40:10,901 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 18:40:10,901 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 18:40:10,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-11-13 18:40:10,918 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:40:10,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-11-13 18:40:10,950 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:40:10,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:40:10,955 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:40:10,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:40:10,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:40:10,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:40:10,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:40:10,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:40:10,975 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 18:40:10,975 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 18:40:10,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-11-13 18:40:10,986 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:40:11,022 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-11-13 18:40:11,022 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:40:11,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:40:11,023 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:40:11,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:40:11,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:40:11,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:40:11,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:40:11,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:40:11,040 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 18:40:11,040 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 18:40:11,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-11-13 18:40:11,051 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:40:11,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-11-13 18:40:11,069 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:40:11,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:40:11,070 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:40:11,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-11-13 18:40:11,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:40:11,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:40:11,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:40:11,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:40:11,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:40:11,081 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 18:40:11,081 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 18:40:11,085 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:40:11,106 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-11-13 18:40:11,106 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:40:11,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:40:11,108 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:40:11,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-11-13 18:40:11,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:40:11,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:40:11,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:40:11,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:40:11,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:40:11,119 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 18:40:11,119 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 18:40:11,122 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:40:11,140 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-11-13 18:40:11,147 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:40:11,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:40:11,147 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:40:11,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:40:11,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-11-13 18:40:11,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:40:11,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:40:11,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:40:11,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:40:11,158 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 18:40:11,158 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 18:40:11,161 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:40:11,182 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2021-11-13 18:40:11,182 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:40:11,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:40:11,183 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:40:11,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-11-13 18:40:11,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-13 18:40:11,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:40:11,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:40:11,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:40:11,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:40:11,197 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 18:40:11,197 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 18:40:11,222 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-13 18:40:11,260 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-11-13 18:40:11,260 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. [2021-11-13 18:40:11,260 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:40:11,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:40:11,267 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:40:11,271 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-13 18:40:11,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-11-13 18:40:11,292 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-13 18:40:11,292 INFO L513 LassoAnalysis]: Proved termination. [2021-11-13 18:40:11,292 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ~#pp~0.base)_2, ULTIMATE.start_f_~i~1#1) = 1*v_rep(select #length ~#pp~0.base)_2 - 2*ULTIMATE.start_f_~i~1#1 Supporting invariants [] [2021-11-13 18:40:11,323 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2021-11-13 18:40:11,565 INFO L297 tatePredicateManager]: 57 out of 57 supporting invariants were superfluous and have been removed [2021-11-13 18:40:11,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:40:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:40:11,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-13 18:40:11,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:40:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:40:11,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-13 18:40:11,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:40:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:40:11,692 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 [2021-11-13 18:40:11,692 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:40:11,803 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 68 states and 88 transitions. Complement of second has 6 states. [2021-11-13 18:40:11,803 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 [2021-11-13 18:40:11,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:40:11,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2021-11-13 18:40:11,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 14 letters. Loop has 3 letters. [2021-11-13 18:40:11,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-13 18:40:11,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 17 letters. Loop has 3 letters. [2021-11-13 18:40:11,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-13 18:40:11,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 14 letters. Loop has 6 letters. [2021-11-13 18:40:11,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-13 18:40:11,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 88 transitions. [2021-11-13 18:40:11,809 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2021-11-13 18:40:11,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 43 states and 54 transitions. [2021-11-13 18:40:11,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2021-11-13 18:40:11,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2021-11-13 18:40:11,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 54 transitions. [2021-11-13 18:40:11,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-13 18:40:11,811 INFO L681 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2021-11-13 18:40:11,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 54 transitions. [2021-11-13 18:40:11,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2021-11-13 18:40:11,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:40:11,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2021-11-13 18:40:11,814 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-11-13 18:40:11,814 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-11-13 18:40:11,814 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-11-13 18:40:11,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2021-11-13 18:40:11,814 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-11-13 18:40:11,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 18:40:11,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 18:40:11,815 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 18:40:11,815 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-13 18:40:11,815 INFO L791 eck$LassoCheckResult]: Stem: 1019#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1005#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~ret15#1.base, main_#t~ret15#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post7#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1006#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 998#L19-2 init_#t~post7#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post7#1;havoc init_#t~post7#1; 999#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1027#L19-2 init_#t~post7#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post7#1;havoc init_#t~post7#1; 1028#L19-3 assume !(init_~i~0#1 < 2); 1024#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post13#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post13#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post13#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post13#1;havoc malloc_#t~post13#1; 1010#L49 main_#t~ret14#1.base, main_#t~ret14#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post13#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post13#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post13#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post13#1;havoc malloc_#t~post13#1; 1009#L49-1 main_#t~ret15#1.base, main_#t~ret15#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret15#1.base, main_#t~ret15#1.offset;havoc main_#t~ret15#1.base, main_#t~ret15#1.offset; 1003#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset, f_#t~post8#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1004#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem9#1.base, f_#t~mem9#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1026#L28 assume f_#t~mem9#1.base == 0 && f_#t~mem9#1.offset == 0;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1021#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset, f_#t~post8#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1022#L27-7 assume !(f_~i~1#1 < 2); 1012#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem11#1.base, g_#t~mem11#1.offset, g_#t~mem12#1, g_#t~post10#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1000#L38-3 [2021-11-13 18:40:11,816 INFO L793 eck$LassoCheckResult]: Loop: 1000#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem11#1.base, g_#t~mem11#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1002#L39 assume !(g_#t~mem11#1.base == g_~pointer#1.base && g_#t~mem11#1.offset == g_~pointer#1.offset);havoc g_#t~mem11#1.base, g_#t~mem11#1.offset; 1017#L38-2 g_#t~post10#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post10#1;havoc g_#t~post10#1; 1000#L38-3 [2021-11-13 18:40:11,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:40:11,816 INFO L85 PathProgramCache]: Analyzing trace with hash -809029298, now seen corresponding path program 1 times [2021-11-13 18:40:11,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:40:11,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902159167] [2021-11-13 18:40:11,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:40:11,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:40:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:40:11,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-11-13 18:40:11,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-13 18:40:11,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:40:11,850 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902159167] [2021-11-13 18:40:11,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902159167] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:40:11,850 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:40:11,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 18:40:11,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608343108] [2021-11-13 18:40:11,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:40:11,851 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-13 18:40:11,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:40:11,851 INFO L85 PathProgramCache]: Analyzing trace with hash 100808, now seen corresponding path program 1 times [2021-11-13 18:40:11,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:40:11,852 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891051449] [2021-11-13 18:40:11,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:40:11,852 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:40:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:40:11,855 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 18:40:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:40:11,859 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 18:40:11,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:40:11,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 18:40:11,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-13 18:40:11,909 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:40:11,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:40:11,924 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2021-11-13 18:40:11,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 18:40:11,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2021-11-13 18:40:11,926 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2021-11-13 18:40:11,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2021-11-13 18:40:11,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2021-11-13 18:40:11,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2021-11-13 18:40:11,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2021-11-13 18:40:11,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-13 18:40:11,928 INFO L681 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2021-11-13 18:40:11,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2021-11-13 18:40:11,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2021-11-13 18:40:11,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:40:11,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2021-11-13 18:40:11,931 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2021-11-13 18:40:11,931 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2021-11-13 18:40:11,931 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-11-13 18:40:11,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2021-11-13 18:40:11,932 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-11-13 18:40:11,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 18:40:11,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 18:40:11,933 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 18:40:11,933 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-13 18:40:11,933 INFO L791 eck$LassoCheckResult]: Stem: 1102#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1088#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~ret15#1.base, main_#t~ret15#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post7#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1089#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1081#L19-2 init_#t~post7#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post7#1;havoc init_#t~post7#1; 1082#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1110#L19-2 init_#t~post7#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post7#1;havoc init_#t~post7#1; 1111#L19-3 assume !(init_~i~0#1 < 2); 1107#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post13#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post13#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post13#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post13#1;havoc malloc_#t~post13#1; 1093#L49 main_#t~ret14#1.base, main_#t~ret14#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post13#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post13#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post13#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post13#1;havoc malloc_#t~post13#1; 1092#L49-1 main_#t~ret15#1.base, main_#t~ret15#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret15#1.base, main_#t~ret15#1.offset;havoc main_#t~ret15#1.base, main_#t~ret15#1.offset; 1083#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset, f_#t~post8#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1084#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem9#1.base, f_#t~mem9#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1109#L28 assume f_#t~mem9#1.base == 0 && f_#t~mem9#1.offset == 0;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1104#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset, f_#t~post8#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1105#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem9#1.base, f_#t~mem9#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1094#L28-1 assume f_#t~mem9#1.base == 0 && f_#t~mem9#1.offset == 0;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1095#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem11#1.base, g_#t~mem11#1.offset, g_#t~mem12#1, g_#t~post10#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1085#L38-3 [2021-11-13 18:40:11,933 INFO L793 eck$LassoCheckResult]: Loop: 1085#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem11#1.base, g_#t~mem11#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1087#L39 assume !(g_#t~mem11#1.base == g_~pointer#1.base && g_#t~mem11#1.offset == g_~pointer#1.offset);havoc g_#t~mem11#1.base, g_#t~mem11#1.offset; 1100#L38-2 g_#t~post10#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post10#1;havoc g_#t~post10#1; 1085#L38-3 [2021-11-13 18:40:11,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:40:11,934 INFO L85 PathProgramCache]: Analyzing trace with hash 689897275, now seen corresponding path program 1 times [2021-11-13 18:40:11,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:40:11,934 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938686418] [2021-11-13 18:40:11,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:40:11,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:40:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:40:12,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-13 18:40:12,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:40:12,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938686418] [2021-11-13 18:40:12,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938686418] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:40:12,158 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:40:12,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-13 18:40:12,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971798121] [2021-11-13 18:40:12,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:40:12,160 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-13 18:40:12,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:40:12,161 INFO L85 PathProgramCache]: Analyzing trace with hash 100808, now seen corresponding path program 2 times [2021-11-13 18:40:12,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:40:12,161 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145593387] [2021-11-13 18:40:12,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:40:12,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:40:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:40:12,166 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 18:40:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:40:12,173 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 18:40:12,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:40:12,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-13 18:40:12,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-13 18:40:12,228 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 11 Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:40:12,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:40:12,416 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2021-11-13 18:40:12,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 18:40:12,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 55 transitions. [2021-11-13 18:40:12,418 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2021-11-13 18:40:12,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 54 transitions. [2021-11-13 18:40:12,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2021-11-13 18:40:12,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2021-11-13 18:40:12,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2021-11-13 18:40:12,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-13 18:40:12,419 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2021-11-13 18:40:12,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2021-11-13 18:40:12,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2021-11-13 18:40:12,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:40:12,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2021-11-13 18:40:12,422 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2021-11-13 18:40:12,422 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2021-11-13 18:40:12,422 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-11-13 18:40:12,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2021-11-13 18:40:12,422 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-11-13 18:40:12,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 18:40:12,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 18:40:12,423 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 18:40:12,423 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-13 18:40:12,424 INFO L791 eck$LassoCheckResult]: Stem: 1201#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1189#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~ret15#1.base, main_#t~ret15#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post7#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1190#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1180#L19-2 init_#t~post7#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post7#1;havoc init_#t~post7#1; 1181#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1209#L19-2 init_#t~post7#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post7#1;havoc init_#t~post7#1; 1210#L19-3 assume !(init_~i~0#1 < 2); 1206#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post13#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post13#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post13#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post13#1;havoc malloc_#t~post13#1; 1196#L49 main_#t~ret14#1.base, main_#t~ret14#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post13#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post13#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post13#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post13#1;havoc malloc_#t~post13#1; 1191#L49-1 main_#t~ret15#1.base, main_#t~ret15#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret15#1.base, main_#t~ret15#1.offset;havoc main_#t~ret15#1.base, main_#t~ret15#1.offset; 1185#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset, f_#t~post8#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1186#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem9#1.base, f_#t~mem9#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1208#L28 assume f_#t~mem9#1.base == 0 && f_#t~mem9#1.offset == 0;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1203#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset, f_#t~post8#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1204#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem9#1.base, f_#t~mem9#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1194#L28-1 assume !(f_#t~mem9#1.base == 0 && f_#t~mem9#1.offset == 0);havoc f_#t~mem9#1.base, f_#t~mem9#1.offset; 1195#L27-6 f_#t~post8#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post8#1;havoc f_#t~post8#1; 1202#L27-7 assume !(f_~i~1#1 < 2); 1193#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem11#1.base, g_#t~mem11#1.offset, g_#t~mem12#1, g_#t~post10#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1182#L38-3 [2021-11-13 18:40:12,424 INFO L793 eck$LassoCheckResult]: Loop: 1182#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem11#1.base, g_#t~mem11#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1184#L39 assume !(g_#t~mem11#1.base == g_~pointer#1.base && g_#t~mem11#1.offset == g_~pointer#1.offset);havoc g_#t~mem11#1.base, g_#t~mem11#1.offset; 1199#L38-2 g_#t~post10#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post10#1;havoc g_#t~post10#1; 1182#L38-3 [2021-11-13 18:40:12,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:40:12,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1566375042, now seen corresponding path program 1 times [2021-11-13 18:40:12,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:40:12,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669741131] [2021-11-13 18:40:12,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:40:12,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:40:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:40:12,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-13 18:40:12,457 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:40:12,457 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669741131] [2021-11-13 18:40:12,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669741131] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:40:12,457 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749057275] [2021-11-13 18:40:12,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:40:12,458 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:40:12,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:40:12,464 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:40:12,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2021-11-13 18:40:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:40:12,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-13 18:40:12,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:40:12,554 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-13 18:40:12,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 18:40:12,592 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-13 18:40:12,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749057275] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 18:40:12,593 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 18:40:12,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-11-13 18:40:12,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124763793] [2021-11-13 18:40:12,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 18:40:12,594 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-13 18:40:12,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:40:12,594 INFO L85 PathProgramCache]: Analyzing trace with hash 100808, now seen corresponding path program 3 times [2021-11-13 18:40:12,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:40:12,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121722068] [2021-11-13 18:40:12,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:40:12,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:40:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:40:12,598 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 18:40:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:40:12,602 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 18:40:12,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:40:12,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 18:40:12,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-13 18:40:12,657 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:40:12,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:40:12,686 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2021-11-13 18:40:12,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 18:40:12,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2021-11-13 18:40:12,688 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2021-11-13 18:40:12,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2021-11-13 18:40:12,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2021-11-13 18:40:12,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2021-11-13 18:40:12,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2021-11-13 18:40:12,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-13 18:40:12,689 INFO L681 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2021-11-13 18:40:12,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2021-11-13 18:40:12,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2021-11-13 18:40:12,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:40:12,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2021-11-13 18:40:12,691 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2021-11-13 18:40:12,691 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2021-11-13 18:40:12,691 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-11-13 18:40:12,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2021-11-13 18:40:12,692 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-11-13 18:40:12,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 18:40:12,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 18:40:12,693 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 18:40:12,693 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-13 18:40:12,693 INFO L791 eck$LassoCheckResult]: Stem: 1394#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1382#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~ret15#1.base, main_#t~ret15#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post7#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1383#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1373#L19-2 init_#t~post7#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post7#1;havoc init_#t~post7#1; 1374#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1403#L19-2 init_#t~post7#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post7#1;havoc init_#t~post7#1; 1404#L19-3 assume !(init_~i~0#1 < 2); 1399#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post13#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post13#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post13#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post13#1;havoc malloc_#t~post13#1; 1389#L49 main_#t~ret14#1.base, main_#t~ret14#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post13#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post13#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post13#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post13#1;havoc malloc_#t~post13#1; 1384#L49-1 main_#t~ret15#1.base, main_#t~ret15#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret15#1.base, main_#t~ret15#1.offset;havoc main_#t~ret15#1.base, main_#t~ret15#1.offset; 1378#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset, f_#t~post8#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1379#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem9#1.base, f_#t~mem9#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1401#L28 assume f_#t~mem9#1.base == 0 && f_#t~mem9#1.offset == 0;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1396#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset, f_#t~post8#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1397#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem9#1.base, f_#t~mem9#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1387#L28-1 assume !(f_#t~mem9#1.base == 0 && f_#t~mem9#1.offset == 0);havoc f_#t~mem9#1.base, f_#t~mem9#1.offset; 1388#L27-6 f_#t~post8#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post8#1;havoc f_#t~post8#1; 1395#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem9#1.base, f_#t~mem9#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1385#L28-1 assume f_#t~mem9#1.base == 0 && f_#t~mem9#1.offset == 0;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1386#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem11#1.base, g_#t~mem11#1.offset, g_#t~mem12#1, g_#t~post10#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1375#L38-3 [2021-11-13 18:40:12,693 INFO L793 eck$LassoCheckResult]: Loop: 1375#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem11#1.base, g_#t~mem11#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1377#L39 assume !(g_#t~mem11#1.base == g_~pointer#1.base && g_#t~mem11#1.offset == g_~pointer#1.offset);havoc g_#t~mem11#1.base, g_#t~mem11#1.offset; 1392#L38-2 g_#t~post10#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post10#1;havoc g_#t~post10#1; 1375#L38-3 [2021-11-13 18:40:12,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:40:12,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1312987783, now seen corresponding path program 1 times [2021-11-13 18:40:12,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:40:12,694 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593012235] [2021-11-13 18:40:12,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:40:12,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:40:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:40:12,788 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 18:40:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:40:12,833 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 18:40:12,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:40:12,839 INFO L85 PathProgramCache]: Analyzing trace with hash 100808, now seen corresponding path program 4 times [2021-11-13 18:40:12,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:40:12,839 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939430371] [2021-11-13 18:40:12,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:40:12,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:40:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:40:12,843 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 18:40:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:40:12,851 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 18:40:12,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:40:12,853 INFO L85 PathProgramCache]: Analyzing trace with hash 951949698, now seen corresponding path program 1 times [2021-11-13 18:40:12,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:40:12,853 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734658129] [2021-11-13 18:40:12,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:40:12,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:40:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:40:13,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-13 18:40:13,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:40:13,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734658129] [2021-11-13 18:40:13,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734658129] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:40:13,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137145624] [2021-11-13 18:40:13,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:40:13,433 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:40:13,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:40:13,434 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:40:13,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2021-11-13 18:40:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:40:13,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 46 conjunts are in the unsatisfiable core [2021-11-13 18:40:13,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:40:13,523 INFO L388 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 138 treesize of output 134 [2021-11-13 18:40:13,768 INFO L388 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 31 treesize of output 7 [2021-11-13 18:40:13,778 INFO L388 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 31 treesize of output 7 [2021-11-13 18:40:14,007 INFO L354 Elim1Store]: treesize reduction 126, result has 13.1 percent of original size [2021-11-13 18:40:14,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 83 [2021-11-13 18:40:14,041 INFO L354 Elim1Store]: treesize reduction 126, result has 13.1 percent of original size [2021-11-13 18:40:14,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 36 [2021-11-13 18:40:14,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2021-11-13 18:40:14,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-11-13 18:40:14,170 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-13 18:40:14,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 18:40:26,420 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_f_~i~1#1_83| Int)) (or (< |v_ULTIMATE.start_f_~i~1#1_83| (+ |c_ULTIMATE.start_f_~i~1#1| 1)) (and (forall ((|ULTIMATE.start_f_~pointer#1.base| Int) (v_DerPreprocessor_21 Int)) (= (select (select (let ((.cse1 (* |v_ULTIMATE.start_f_~i~1#1_83| 4))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| .cse1) |ULTIMATE.start_f_~pointer#1.base|)))) (store .cse0 |c_~#pstate~0.base| (store (select .cse0 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse1) v_DerPreprocessor_21)))) |c_~#pp~0.base|) |c_~#pp~0.offset|) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_DerPreprocessor_22 Int) (|ULTIMATE.start_f_~pointer#1.offset| Int)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (let ((.cse3 (* |v_ULTIMATE.start_f_~i~1#1_83| 4))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| .cse3) |ULTIMATE.start_f_~pointer#1.offset|)))) (store .cse2 |c_~#pstate~0.base| (store (select .cse2 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse3) v_DerPreprocessor_22)))) |c_~#pp~0.base|) |c_~#pp~0.offset|)))))) is different from false [2021-11-13 18:40:38,587 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_f_~i~1#1_83| Int)) (or (and (forall ((|ULTIMATE.start_f_~pointer#1.base| Int) (v_DerPreprocessor_21 Int)) (= (select (select (let ((.cse1 (* |v_ULTIMATE.start_f_~i~1#1_83| 4))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| .cse1) |ULTIMATE.start_f_~pointer#1.base|)))) (store .cse0 |c_~#pstate~0.base| (store (select .cse0 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse1) v_DerPreprocessor_21)))) |c_~#pp~0.base|) |c_~#pp~0.offset|) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_DerPreprocessor_22 Int) (|ULTIMATE.start_f_~pointer#1.offset| Int)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (let ((.cse3 (* |v_ULTIMATE.start_f_~i~1#1_83| 4))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| .cse3) |ULTIMATE.start_f_~pointer#1.offset|)))) (store .cse2 |c_~#pstate~0.base| (store (select .cse2 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse3) v_DerPreprocessor_22)))) |c_~#pp~0.base|) |c_~#pp~0.offset|)))) (< |v_ULTIMATE.start_f_~i~1#1_83| 1))) is different from false [2021-11-13 18:40:38,591 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [|ULTIMATE.start_f_~pointer#1.base|] [2021-11-13 18:40:38,591 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-13 18:40:38,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2021-11-13 18:40:38,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286201503] [2021-11-13 18:40:38,591 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-13 18:40:38,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:40:38,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-13 18:40:38,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=390, Unknown=2, NotChecked=82, Total=552 [2021-11-13 18:40:38,635 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. cyclomatic complexity: 11 Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:40:39,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:40:39,092 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2021-11-13 18:40:39,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-13 18:40:39,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 64 transitions. [2021-11-13 18:40:39,094 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2021-11-13 18:40:39,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 64 transitions. [2021-11-13 18:40:39,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2021-11-13 18:40:39,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2021-11-13 18:40:39,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 64 transitions. [2021-11-13 18:40:39,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-13 18:40:39,096 INFO L681 BuchiCegarLoop]: Abstraction has 54 states and 64 transitions. [2021-11-13 18:40:39,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 64 transitions. [2021-11-13 18:40:39,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2021-11-13 18:40:39,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:40:39,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2021-11-13 18:40:39,099 INFO L704 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2021-11-13 18:40:39,099 INFO L587 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2021-11-13 18:40:39,099 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-11-13 18:40:39,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 45 transitions. [2021-11-13 18:40:39,100 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-11-13 18:40:39,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 18:40:39,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 18:40:39,101 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 18:40:39,101 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-11-13 18:40:39,101 INFO L791 eck$LassoCheckResult]: Stem: 1616#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1604#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~ret15#1.base, main_#t~ret15#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post7#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1605#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1596#L19-2 init_#t~post7#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post7#1;havoc init_#t~post7#1; 1597#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1630#L19-2 init_#t~post7#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post7#1;havoc init_#t~post7#1; 1631#L19-3 assume !(init_~i~0#1 < 2); 1624#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post13#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post13#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post13#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post13#1;havoc malloc_#t~post13#1; 1607#L49 main_#t~ret14#1.base, main_#t~ret14#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post13#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post13#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post13#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post13#1;havoc malloc_#t~post13#1; 1606#L49-1 main_#t~ret15#1.base, main_#t~ret15#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret15#1.base, main_#t~ret15#1.offset;havoc main_#t~ret15#1.base, main_#t~ret15#1.offset; 1598#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset, f_#t~post8#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1599#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem9#1.base, f_#t~mem9#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1626#L28 assume f_#t~mem9#1.base == 0 && f_#t~mem9#1.offset == 0;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1618#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset, f_#t~post8#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1619#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem9#1.base, f_#t~mem9#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1627#L28-1 assume !(f_#t~mem9#1.base == 0 && f_#t~mem9#1.offset == 0);havoc f_#t~mem9#1.base, f_#t~mem9#1.offset; 1632#L27-6 f_#t~post8#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post8#1;havoc f_#t~post8#1; 1628#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem9#1.base, f_#t~mem9#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1629#L28-1 assume f_#t~mem9#1.base == 0 && f_#t~mem9#1.offset == 0;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1620#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem11#1.base, g_#t~mem11#1.offset, g_#t~mem12#1, g_#t~post10#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1600#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem11#1.base, g_#t~mem11#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1601#L39 assume g_#t~mem11#1.base == g_~pointer#1.base && g_#t~mem11#1.offset == g_~pointer#1.offset;havoc g_#t~mem11#1.base, g_#t~mem11#1.offset;call g_#t~mem12#1 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1615#L41 [2021-11-13 18:40:39,101 INFO L793 eck$LassoCheckResult]: Loop: 1615#L41 assume 1 == g_#t~mem12#1; 1613#L41-2 havoc g_#t~mem12#1;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1614#L38-2 g_#t~post10#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post10#1;havoc g_#t~post10#1; 1623#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem11#1.base, g_#t~mem11#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1633#L39 assume g_#t~mem11#1.base == g_~pointer#1.base && g_#t~mem11#1.offset == g_~pointer#1.offset;havoc g_#t~mem11#1.base, g_#t~mem11#1.offset;call g_#t~mem12#1 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1615#L41 [2021-11-13 18:40:39,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:40:39,102 INFO L85 PathProgramCache]: Analyzing trace with hash -939123286, now seen corresponding path program 1 times [2021-11-13 18:40:39,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:40:39,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220996202] [2021-11-13 18:40:39,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:40:39,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:40:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:40:39,138 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 18:40:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:40:39,203 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 18:40:39,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:40:39,204 INFO L85 PathProgramCache]: Analyzing trace with hash 102360307, now seen corresponding path program 1 times [2021-11-13 18:40:39,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:40:39,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058026974] [2021-11-13 18:40:39,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:40:39,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:40:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:40:39,208 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 18:40:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:40:39,212 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 18:40:39,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:40:39,213 INFO L85 PathProgramCache]: Analyzing trace with hash -289347350, now seen corresponding path program 1 times [2021-11-13 18:40:39,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:40:39,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204992] [2021-11-13 18:40:39,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:40:39,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:40:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:40:39,492 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-13 18:40:39,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:40:39,492 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204992] [2021-11-13 18:40:39,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204992] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:40:39,492 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165144978] [2021-11-13 18:40:39,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:40:39,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:40:39,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:40:39,493 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:40:39,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2021-11-13 18:40:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:40:39,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-13 18:40:39,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:40:39,579 INFO L388 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 202 treesize of output 198 [2021-11-13 18:40:39,763 INFO L388 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 39 treesize of output 9 [2021-11-13 18:40:39,878 INFO L354 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2021-11-13 18:40:39,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 17 [2021-11-13 18:40:39,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-13 18:40:39,964 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-13 18:40:39,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 18:40:40,141 INFO L354 Elim1Store]: treesize reduction 44, result has 33.3 percent of original size [2021-11-13 18:40:40,141 INFO L388 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 67 treesize of output 41 [2021-11-13 18:40:40,148 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-13 18:40:40,149 INFO L388 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 59 treesize of output 59 [2021-11-13 18:40:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-13 18:40:40,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165144978] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 18:40:40,407 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 18:40:40,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2021-11-13 18:40:40,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858562522] [2021-11-13 18:40:40,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 18:40:40,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:40:40,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-13 18:40:40,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2021-11-13 18:40:40,567 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. cyclomatic complexity: 11 Second operand has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 27 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:40:41,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:40:41,396 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2021-11-13 18:40:41,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-13 18:40:41,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 68 transitions. [2021-11-13 18:40:41,398 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2021-11-13 18:40:41,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 68 transitions. [2021-11-13 18:40:41,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2021-11-13 18:40:41,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2021-11-13 18:40:41,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 68 transitions. [2021-11-13 18:40:41,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-13 18:40:41,400 INFO L681 BuchiCegarLoop]: Abstraction has 58 states and 68 transitions. [2021-11-13 18:40:41,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 68 transitions. [2021-11-13 18:40:41,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2021-11-13 18:40:41,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.18) internal successors, (59), 49 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:40:41,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2021-11-13 18:40:41,406 INFO L704 BuchiCegarLoop]: Abstraction has 50 states and 59 transitions. [2021-11-13 18:40:41,407 INFO L587 BuchiCegarLoop]: Abstraction has 50 states and 59 transitions. [2021-11-13 18:40:41,407 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-11-13 18:40:41,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 59 transitions. [2021-11-13 18:40:41,407 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-11-13 18:40:41,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 18:40:41,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 18:40:41,408 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 18:40:41,409 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-11-13 18:40:41,409 INFO L791 eck$LassoCheckResult]: Stem: 1928#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1913#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~ret15#1.base, main_#t~ret15#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post7#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1914#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1907#L19-2 init_#t~post7#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post7#1;havoc init_#t~post7#1; 1908#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1944#L19-2 init_#t~post7#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post7#1;havoc init_#t~post7#1; 1945#L19-3 assume !(init_~i~0#1 < 2); 1937#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post13#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post13#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post13#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post13#1;havoc malloc_#t~post13#1; 1918#L49 main_#t~ret14#1.base, main_#t~ret14#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post13#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post13#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post13#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post13#1;havoc malloc_#t~post13#1; 1917#L49-1 main_#t~ret15#1.base, main_#t~ret15#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret15#1.base, main_#t~ret15#1.offset;havoc main_#t~ret15#1.base, main_#t~ret15#1.offset; 1909#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset, f_#t~post8#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1910#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem9#1.base, f_#t~mem9#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1941#L28 assume f_#t~mem9#1.base == 0 && f_#t~mem9#1.offset == 0;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1931#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset, f_#t~post8#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1932#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem9#1.base, f_#t~mem9#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1942#L28-1 assume !(f_#t~mem9#1.base == 0 && f_#t~mem9#1.offset == 0);havoc f_#t~mem9#1.base, f_#t~mem9#1.offset; 1929#L27-6 f_#t~post8#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post8#1;havoc f_#t~post8#1; 1930#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem9#1.base, f_#t~mem9#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1921#L28-1 assume !(f_#t~mem9#1.base == 0 && f_#t~mem9#1.offset == 0);havoc f_#t~mem9#1.base, f_#t~mem9#1.offset; 1922#L27-6 f_#t~post8#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post8#1;havoc f_#t~post8#1; 1956#L27-7 assume !(f_~i~1#1 < 2); 1954#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem11#1.base, g_#t~mem11#1.offset, g_#t~mem12#1, g_#t~post10#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1952#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem11#1.base, g_#t~mem11#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1951#L39 assume g_#t~mem11#1.base == g_~pointer#1.base && g_#t~mem11#1.offset == g_~pointer#1.offset;havoc g_#t~mem11#1.base, g_#t~mem11#1.offset;call g_#t~mem12#1 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1950#L41 [2021-11-13 18:40:41,409 INFO L793 eck$LassoCheckResult]: Loop: 1950#L41 assume 1 == g_#t~mem12#1; 1924#L41-2 havoc g_#t~mem12#1;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1925#L38-2 g_#t~post10#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post10#1;havoc g_#t~post10#1; 1946#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem11#1.base, g_#t~mem11#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1947#L39 assume g_#t~mem11#1.base == g_~pointer#1.base && g_#t~mem11#1.offset == g_~pointer#1.offset;havoc g_#t~mem11#1.base, g_#t~mem11#1.offset;call g_#t~mem12#1 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1950#L41 [2021-11-13 18:40:41,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:40:41,410 INFO L85 PathProgramCache]: Analyzing trace with hash -501415375, now seen corresponding path program 1 times [2021-11-13 18:40:41,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:40:41,410 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989140921] [2021-11-13 18:40:41,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:40:41,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:40:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:40:41,618 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:40:41,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:40:41,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989140921] [2021-11-13 18:40:41,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989140921] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:40:41,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622169665] [2021-11-13 18:40:41,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:40:41,619 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:40:41,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:40:41,620 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:40:41,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2021-11-13 18:40:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:40:41,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-13 18:40:41,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:40:41,693 INFO L388 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 103 treesize of output 101 [2021-11-13 18:40:41,754 INFO L388 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 39 treesize of output 9 [2021-11-13 18:40:41,758 INFO L388 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 39 treesize of output 9 [2021-11-13 18:40:41,898 INFO L354 Elim1Store]: treesize reduction 140, result has 13.0 percent of original size [2021-11-13 18:40:41,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 87 [2021-11-13 18:40:41,923 INFO L354 Elim1Store]: treesize reduction 140, result has 13.0 percent of original size [2021-11-13 18:40:41,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 40 [2021-11-13 18:40:42,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2021-11-13 18:40:42,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-11-13 18:40:42,027 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:40:42,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 18:40:54,220 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_f_~i~1#1_93| Int)) (or (and (forall ((v_DerPreprocessor_24 Int) (|ULTIMATE.start_f_~pointer#1.base| Int)) (= 0 (select (select (let ((.cse1 (* |v_ULTIMATE.start_f_~i~1#1_93| 4))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| .cse1) |ULTIMATE.start_f_~pointer#1.base|)))) (store .cse0 |c_~#pstate~0.base| (store (select .cse0 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse1) v_DerPreprocessor_24)))) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)))) (forall ((v_DerPreprocessor_25 Int) (|ULTIMATE.start_f_~pointer#1.offset| Int)) (= (select (select (let ((.cse3 (* |v_ULTIMATE.start_f_~i~1#1_93| 4))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| .cse3) |ULTIMATE.start_f_~pointer#1.offset|)))) (store .cse2 |c_~#pstate~0.base| (store (select .cse2 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse3) v_DerPreprocessor_25)))) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)) 0))) (< 0 |v_ULTIMATE.start_f_~i~1#1_93|))) is different from false [2021-11-13 18:40:54,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1070 treesize of output 1058 [2021-11-13 18:40:54,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1342 treesize of output 1336 [2021-11-13 18:40:56,941 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-11-13 18:40:56,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622169665] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 18:40:56,941 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 18:40:56,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 19 [2021-11-13 18:40:56,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386423789] [2021-11-13 18:40:56,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 18:40:56,942 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-13 18:40:56,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:40:56,943 INFO L85 PathProgramCache]: Analyzing trace with hash 102360307, now seen corresponding path program 2 times [2021-11-13 18:40:56,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:40:56,943 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817615577] [2021-11-13 18:40:56,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:40:56,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:40:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:40:56,947 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 18:40:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:40:56,951 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 18:40:57,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:40:57,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-13 18:40:57,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=279, Unknown=1, NotChecked=34, Total=380 [2021-11-13 18:40:57,168 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. cyclomatic complexity: 14 Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:41:09,255 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_init_~i~0#1| 4) |c_~#pp~0.offset|))) (and (not (= |c_~#pp~0.base| |c_~#pstate~0.base|)) (= |c_ULTIMATE.start_init_~i~0#1| 1) (= (select (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) .cse0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) .cse0) 0) (forall ((|v_ULTIMATE.start_f_~i~1#1_93| Int)) (or (and (forall ((v_DerPreprocessor_24 Int) (|ULTIMATE.start_f_~pointer#1.base| Int)) (= 0 (select (select (let ((.cse2 (* |v_ULTIMATE.start_f_~i~1#1_93| 4))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| .cse2) |ULTIMATE.start_f_~pointer#1.base|)))) (store .cse1 |c_~#pstate~0.base| (store (select .cse1 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse2) v_DerPreprocessor_24)))) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)))) (forall ((v_DerPreprocessor_25 Int) (|ULTIMATE.start_f_~pointer#1.offset| Int)) (= (select (select (let ((.cse4 (* |v_ULTIMATE.start_f_~i~1#1_93| 4))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| .cse4) |ULTIMATE.start_f_~pointer#1.offset|)))) (store .cse3 |c_~#pstate~0.base| (store (select .cse3 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse4) v_DerPreprocessor_25)))) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)) 0))) (< 0 |v_ULTIMATE.start_f_~i~1#1_93|))))) is different from false [2021-11-13 18:41:21,259 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#pp~0.offset| 4))) (and (not (= |c_~#pp~0.base| |c_~#pstate~0.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) .cse0) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) .cse0) 0) (forall ((|v_ULTIMATE.start_f_~i~1#1_93| Int)) (or (and (forall ((v_DerPreprocessor_24 Int) (|ULTIMATE.start_f_~pointer#1.base| Int)) (= 0 (select (select (let ((.cse2 (* |v_ULTIMATE.start_f_~i~1#1_93| 4))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| .cse2) |ULTIMATE.start_f_~pointer#1.base|)))) (store .cse1 |c_~#pstate~0.base| (store (select .cse1 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse2) v_DerPreprocessor_24)))) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)))) (forall ((v_DerPreprocessor_25 Int) (|ULTIMATE.start_f_~pointer#1.offset| Int)) (= (select (select (let ((.cse4 (* |v_ULTIMATE.start_f_~i~1#1_93| 4))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| .cse4) |ULTIMATE.start_f_~pointer#1.offset|)))) (store .cse3 |c_~#pstate~0.base| (store (select .cse3 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse4) v_DerPreprocessor_25)))) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)) 0))) (< 0 |v_ULTIMATE.start_f_~i~1#1_93|))))) is different from false [2021-11-13 18:41:21,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:41:21,424 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2021-11-13 18:41:21,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-13 18:41:21,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 93 transitions. [2021-11-13 18:41:21,426 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 21 [2021-11-13 18:41:21,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 80 states and 92 transitions. [2021-11-13 18:41:21,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2021-11-13 18:41:21,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2021-11-13 18:41:21,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 92 transitions. [2021-11-13 18:41:21,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-13 18:41:21,428 INFO L681 BuchiCegarLoop]: Abstraction has 80 states and 92 transitions. [2021-11-13 18:41:21,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 92 transitions. [2021-11-13 18:41:21,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2021-11-13 18:41:21,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 62 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:41:21,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2021-11-13 18:41:21,433 INFO L704 BuchiCegarLoop]: Abstraction has 63 states and 73 transitions. [2021-11-13 18:41:21,433 INFO L587 BuchiCegarLoop]: Abstraction has 63 states and 73 transitions. [2021-11-13 18:41:21,433 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-11-13 18:41:21,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 73 transitions. [2021-11-13 18:41:21,433 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-11-13 18:41:21,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 18:41:21,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 18:41:21,435 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 18:41:21,435 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-13 18:41:21,435 INFO L791 eck$LassoCheckResult]: Stem: 2233#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 2219#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~ret15#1.base, main_#t~ret15#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post7#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 2220#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 2211#L19-2 init_#t~post7#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post7#1;havoc init_#t~post7#1; 2212#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 2250#L19-2 init_#t~post7#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post7#1;havoc init_#t~post7#1; 2260#L19-3 assume !(init_~i~0#1 < 2); 2257#L17 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post13#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post13#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post13#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post13#1;havoc malloc_#t~post13#1; 2256#L49 main_#t~ret14#1.base, main_#t~ret14#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;assume { :begin_inline_malloc } true;malloc_#in~size#1 := 4;havoc malloc_#res#1.base, malloc_#res#1.offset;havoc malloc_#t~post13#1, malloc_~size#1;malloc_~size#1 := malloc_#in~size#1;malloc_#t~post13#1 := ~counter~0;~counter~0 := 1 + malloc_#t~post13#1;malloc_#res#1.base, malloc_#res#1.offset := 0, malloc_#t~post13#1;havoc malloc_#t~post13#1; 2255#L49-1 main_#t~ret15#1.base, main_#t~ret15#1.offset := malloc_#res#1.base, malloc_#res#1.offset;assume { :end_inline_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret15#1.base, main_#t~ret15#1.offset;havoc main_#t~ret15#1.base, main_#t~ret15#1.offset; 2215#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset, f_#t~post8#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 2216#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem9#1.base, f_#t~mem9#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 2247#L28 assume f_#t~mem9#1.base == 0 && f_#t~mem9#1.offset == 0;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 2253#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset, f_#t~post8#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 2252#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem9#1.base, f_#t~mem9#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 2251#L28-1 assume !(f_#t~mem9#1.base == 0 && f_#t~mem9#1.offset == 0);havoc f_#t~mem9#1.base, f_#t~mem9#1.offset; 2234#L27-6 f_#t~post8#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post8#1;havoc f_#t~post8#1; 2235#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem9#1.base, f_#t~mem9#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 2224#L28-1 assume f_#t~mem9#1.base == 0 && f_#t~mem9#1.offset == 0;havoc f_#t~mem9#1.base, f_#t~mem9#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 2225#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem11#1.base, g_#t~mem11#1.offset, g_#t~mem12#1, g_#t~post10#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 2213#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem11#1.base, g_#t~mem11#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 2214#L39 assume g_#t~mem11#1.base == g_~pointer#1.base && g_#t~mem11#1.offset == g_~pointer#1.offset;havoc g_#t~mem11#1.base, g_#t~mem11#1.offset;call g_#t~mem12#1 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 2243#L41 assume 1 == g_#t~mem12#1; 2229#L41-2 havoc g_#t~mem12#1;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 2230#L38-2 g_#t~post10#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post10#1;havoc g_#t~post10#1; 2242#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem11#1.base, g_#t~mem11#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 2231#L39 [2021-11-13 18:41:21,435 INFO L793 eck$LassoCheckResult]: Loop: 2231#L39 assume !(g_#t~mem11#1.base == g_~pointer#1.base && g_#t~mem11#1.offset == g_~pointer#1.offset);havoc g_#t~mem11#1.base, g_#t~mem11#1.offset; 2232#L38-2 g_#t~post10#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post10#1;havoc g_#t~post10#1; 2263#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem11#1.base, g_#t~mem11#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 2231#L39 [2021-11-13 18:41:21,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:41:21,436 INFO L85 PathProgramCache]: Analyzing trace with hash -147881120, now seen corresponding path program 2 times [2021-11-13 18:41:21,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:41:21,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076005697] [2021-11-13 18:41:21,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:41:21,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:41:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:41:21,472 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 18:41:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:41:21,512 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 18:41:21,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:41:21,513 INFO L85 PathProgramCache]: Analyzing trace with hash 116228, now seen corresponding path program 5 times [2021-11-13 18:41:21,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:41:21,513 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322536778] [2021-11-13 18:41:21,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:41:21,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:41:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:41:21,516 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 18:41:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:41:21,519 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 18:41:21,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:41:21,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1110086213, now seen corresponding path program 1 times [2021-11-13 18:41:21,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:41:21,520 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204530285] [2021-11-13 18:41:21,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:41:21,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:41:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:41:21,562 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-13 18:41:21,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:41:21,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204530285] [2021-11-13 18:41:21,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204530285] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:41:21,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884410776] [2021-11-13 18:41:21,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:41:21,563 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:41:21,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:41:21,567 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:41:21,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2021-11-13 18:41:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:41:21,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-13 18:41:21,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:41:21,701 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-13 18:41:21,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-13 18:41:21,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884410776] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:41:21,702 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-13 18:41:21,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-11-13 18:41:21,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687473420] [2021-11-13 18:41:21,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:41:21,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:41:21,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 18:41:21,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-13 18:41:21,762 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. cyclomatic complexity: 15 Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:41:21,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:41:21,802 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2021-11-13 18:41:21,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-13 18:41:21,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 82 transitions. [2021-11-13 18:41:21,804 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-11-13 18:41:21,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 0 states and 0 transitions. [2021-11-13 18:41:21,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-11-13 18:41:21,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-11-13 18:41:21,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-11-13 18:41:21,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 18:41:21,804 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-13 18:41:21,805 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-13 18:41:21,805 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-13 18:41:21,805 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-11-13 18:41:21,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-11-13 18:41:21,805 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-11-13 18:41:21,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-11-13 18:41:21,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.11 06:41:21 BoogieIcfgContainer [2021-11-13 18:41:21,810 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-11-13 18:41:21,811 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-13 18:41:21,811 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-13 18:41:21,811 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-13 18:41:21,811 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 06:39:11" (3/4) ... [2021-11-13 18:41:21,814 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-13 18:41:21,814 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-13 18:41:21,815 INFO L158 Benchmark]: Toolchain (without parser) took 131523.07ms. Allocated memory was 81.8MB in the beginning and 148.9MB in the end (delta: 67.1MB). Free memory was 45.0MB in the beginning and 42.8MB in the end (delta: 2.2MB). Peak memory consumption was 69.9MB. Max. memory is 16.1GB. [2021-11-13 18:41:21,815 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 81.8MB. Free memory was 61.7MB in the beginning and 61.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 18:41:21,815 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.17ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 44.8MB in the beginning and 74.7MB in the end (delta: -29.9MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2021-11-13 18:41:21,815 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.90ms. Allocated memory is still 98.6MB. Free memory was 74.7MB in the beginning and 72.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-13 18:41:21,816 INFO L158 Benchmark]: Boogie Preprocessor took 58.34ms. Allocated memory is still 98.6MB. Free memory was 72.8MB in the beginning and 71.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-13 18:41:21,816 INFO L158 Benchmark]: RCFGBuilder took 435.36ms. Allocated memory is still 98.6MB. Free memory was 71.1MB in the beginning and 56.1MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-13 18:41:21,816 INFO L158 Benchmark]: BuchiAutomizer took 130666.39ms. Allocated memory was 98.6MB in the beginning and 148.9MB in the end (delta: 50.3MB). Free memory was 56.1MB in the beginning and 42.8MB in the end (delta: 13.4MB). Peak memory consumption was 66.2MB. Max. memory is 16.1GB. [2021-11-13 18:41:21,817 INFO L158 Benchmark]: Witness Printer took 3.77ms. Allocated memory is still 148.9MB. Free memory is still 42.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 18:41:21,819 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.21ms. Allocated memory is still 81.8MB. Free memory was 61.7MB in the beginning and 61.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 284.17ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 44.8MB in the beginning and 74.7MB in the end (delta: -29.9MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.90ms. Allocated memory is still 98.6MB. Free memory was 74.7MB in the beginning and 72.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.34ms. Allocated memory is still 98.6MB. Free memory was 72.8MB in the beginning and 71.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 435.36ms. Allocated memory is still 98.6MB. Free memory was 71.1MB in the beginning and 56.1MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 130666.39ms. Allocated memory was 98.6MB in the beginning and 148.9MB in the end (delta: 50.3MB). Free memory was 56.1MB in the beginning and 42.8MB in the end (delta: 13.4MB). Peak memory consumption was 66.2MB. Max. memory is 16.1GB. * Witness Printer took 3.77ms. Allocated memory is still 148.9MB. Free memory is still 42.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (10 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 3 + -2 * i and consists of 5 locations. One deterministic module has affine ranking function -2 * i + unknown-#length-unknown[pp] and consists of 4 locations. 10 modules have a trivial ranking function, the largest among these consists of 28 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 130.6s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 103.8s. Construction of modules took 0.9s. Büchi inclusion checks took 25.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 95 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 63 states and ocurred in iteration 11. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 560 SdHoareTripleChecker+Valid, 1161.23ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 558 mSDsluCounter, 1120 SdHoareTripleChecker+Invalid, 967.68ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 120 IncrementalHoareTripleChecker+Unchecked, 820 mSDsCounter, 158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1211 IncrementalHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 158 mSolverCounterUnsat, 300 mSDtfsCounter, 1211 mSolverCounterSat, 22.97ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU6 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital1581 mio100 ax100 hnf100 lsp97 ukn23 mio100 lsp36 div100 bol100 ite100 ukn100 eq177 hnf92 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 149ms VariablesStem: 8 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 48 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! [2021-11-13 18:41:21,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2021-11-13 18:41:22,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2021-11-13 18:41:22,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2021-11-13 18:41:22,471 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2021-11-13 18:41:22,672 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2021-11-13 18:41:22,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-11-13 18:41:23,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-13 18:41:23,258 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d4658c-1090-414f-9c0b-49809c56c26d/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE