./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 cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-regression/ex3_forlist.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --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 ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:13:51,964 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:13:52,082 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-12 02:13:52,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:13:52,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:13:52,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:13:52,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:13:52,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:13:52,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:13:52,120 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:13:52,120 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:13:52,121 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-12 02:13:52,121 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-12 02:13:52,122 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-12 02:13:52,123 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-12 02:13:52,123 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-12 02:13:52,124 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-12 02:13:52,124 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:13:52,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-12 02:13:52,125 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:13:52,126 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:13:52,133 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:13:52,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:13:52,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-12 02:13:52,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-12 02:13:52,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-12 02:13:52,135 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:13:52,135 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:13:52,135 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:13:52,136 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-12 02:13:52,137 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:13:52,137 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:13:52,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:13:52,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:13:52,138 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:13:52,139 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-12 02:13:52,139 INFO L153 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_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/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_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e [2023-11-12 02:13:52,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:13:52,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:13:52,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:13:52,463 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:13:52,464 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:13:52,465 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2023-11-12 02:13:55,697 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:13:55,881 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:13:55,881 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2023-11-12 02:13:55,889 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/data/223605daf/330603f8af354cf99f1d4127eb0b9f3c/FLAGa4728e7a0 [2023-11-12 02:13:55,903 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/data/223605daf/330603f8af354cf99f1d4127eb0b9f3c [2023-11-12 02:13:55,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:13:55,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:13:55,909 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:13:55,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:13:55,914 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:13:55,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:13:55" (1/1) ... [2023-11-12 02:13:55,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd0ab64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:55, skipping insertion in model container [2023-11-12 02:13:55,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:13:55" (1/1) ... [2023-11-12 02:13:55,940 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:13:56,120 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:13:56,133 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:13:56,151 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:13:56,169 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:13:56,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:56 WrapperNode [2023-11-12 02:13:56,170 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:13:56,171 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:13:56,171 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:13:56,171 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:13:56,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:56" (1/1) ... [2023-11-12 02:13:56,186 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:56" (1/1) ... [2023-11-12 02:13:56,217 INFO L138 Inliner]: procedures = 19, calls = 30, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 139 [2023-11-12 02:13:56,217 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:13:56,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:13:56,218 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:13:56,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:13:56,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:56" (1/1) ... [2023-11-12 02:13:56,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:56" (1/1) ... [2023-11-12 02:13:56,233 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:56" (1/1) ... [2023-11-12 02:13:56,233 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:56" (1/1) ... [2023-11-12 02:13:56,244 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:56" (1/1) ... [2023-11-12 02:13:56,248 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:56" (1/1) ... [2023-11-12 02:13:56,250 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:56" (1/1) ... [2023-11-12 02:13:56,252 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:56" (1/1) ... [2023-11-12 02:13:56,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:13:56,256 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:13:56,256 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:13:56,256 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:13:56,257 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:56" (1/1) ... [2023-11-12 02:13:56,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:13:56,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:13:56,294 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:13:56,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-12 02:13:56,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 02:13:56,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 02:13:56,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:13:56,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:13:56,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 02:13:56,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:13:56,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:13:56,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:13:56,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:13:56,472 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:13:56,474 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:13:56,881 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:13:56,888 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:13:56,889 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-12 02:13:56,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:13:56 BoogieIcfgContainer [2023-11-12 02:13:56,899 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:13:56,900 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-12 02:13:56,900 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-12 02:13:56,904 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-12 02:13:56,906 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-12 02:13:56,906 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.11 02:13:55" (1/3) ... [2023-11-12 02:13:56,909 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2fb509c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 02:13:56, skipping insertion in model container [2023-11-12 02:13:56,909 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-12 02:13:56,909 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:56" (2/3) ... [2023-11-12 02:13:56,910 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2fb509c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 02:13:56, skipping insertion in model container [2023-11-12 02:13:56,911 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-12 02:13:56,911 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:13:56" (3/3) ... [2023-11-12 02:13:56,912 INFO L332 chiAutomizerObserver]: Analyzing ICFG ex3_forlist.i [2023-11-12 02:13:56,966 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-12 02:13:56,967 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-12 02:13:56,967 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-12 02:13:56,967 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-12 02:13:56,967 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-12 02:13:56,967 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-12 02:13:56,968 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-12 02:13:56,968 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-12 02:13:56,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 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) [2023-11-12 02:13:56,991 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-12 02:13:56,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:13:56,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:13:56,997 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-12 02:13:56,998 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-12 02:13:56,998 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-12 02:13:56,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 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) [2023-11-12 02:13:57,005 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-12 02:13:57,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:13:57,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:13:57,006 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-12 02:13:57,006 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-12 02:13:57,014 INFO L748 eck$LassoCheckResult]: Stem: 33#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);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);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);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; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#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~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 37#L19-3true [2023-11-12 02:13:57,014 INFO L750 eck$LassoCheckResult]: Loop: 37#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); 2#L19-2true init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 37#L19-3true [2023-11-12 02:13:57,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:57,025 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-12 02:13:57,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:13:57,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670622033] [2023-11-12 02:13:57,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:57,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:13:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:13:57,160 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:13:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:13:57,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:13:57,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:57,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2023-11-12 02:13:57,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:13:57,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510769378] [2023-11-12 02:13:57,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:57,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:13:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:13:57,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:13:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:13:57,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:13:57,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:57,300 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2023-11-12 02:13:57,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:13:57,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322403651] [2023-11-12 02:13:57,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:57,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:13:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:13:57,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:13:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:13:57,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:13:58,076 INFO L210 LassoAnalysis]: Preferences: [2023-11-12 02:13:58,077 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-12 02:13:58,077 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-12 02:13:58,078 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-12 02:13:58,078 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-12 02:13:58,078 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:13:58,078 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-12 02:13:58,078 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-12 02:13:58,079 INFO L133 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration1_Lasso [2023-11-12 02:13:58,079 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-12 02:13:58,079 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-12 02:13:58,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:13:58,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:13:58,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:13:58,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:13:58,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:13:58,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:13:58,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:13:58,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:13:58,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:13:58,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:13:58,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:13:58,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:13:58,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:13:59,158 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-12 02:13:59,163 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-12 02:13:59,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:13:59,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:13:59,170 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:13:59,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-12 02:13:59,192 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 [2023-11-12 02:13:59,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:13:59,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:13:59,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:13:59,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:13:59,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:13:59,210 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:13:59,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:13:59,225 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:13:59,236 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-12 02:13:59,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:13:59,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:13:59,239 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:13:59,250 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 [2023-11-12 02:13:59,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-12 02:13:59,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:13:59,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:13:59,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:13:59,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:13:59,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:13:59,264 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:13:59,264 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:13:59,273 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:13:59,277 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-12 02:13:59,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:13:59,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:13:59,280 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:13:59,288 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 [2023-11-12 02:13:59,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:13:59,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:13:59,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:13:59,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:13:59,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:13:59,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:13:59,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:13:59,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-12 02:13:59,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:13:59,325 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-12 02:13:59,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:13:59,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:13:59,333 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:13:59,346 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 [2023-11-12 02:13:59,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:13:59,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:13:59,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:13:59,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:13:59,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:13:59,360 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:13:59,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:13:59,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-12 02:13:59,372 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:13:59,377 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-12 02:13:59,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:13:59,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:13:59,380 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:13:59,412 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 [2023-11-12 02:13:59,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-12 02:13:59,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:13:59,429 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:13:59,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:13:59,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:13:59,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:13:59,430 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:13:59,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:13:59,444 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:13:59,456 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-11-12 02:13:59,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:13:59,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:13:59,458 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:13:59,467 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 [2023-11-12 02:13:59,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:13:59,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:13:59,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:13:59,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:13:59,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:13:59,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-12 02:13:59,482 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:13:59,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:13:59,500 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:13:59,509 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-11-12 02:13:59,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:13:59,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:13:59,511 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:13:59,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-12 02:13:59,520 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 [2023-11-12 02:13:59,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:13:59,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:13:59,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:13:59,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:13:59,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:13:59,534 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:13:59,534 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:13:59,543 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:13:59,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-11-12 02:13:59,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:13:59,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:13:59,554 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:13:59,563 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 [2023-11-12 02:13:59,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:13:59,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:13:59,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:13:59,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:13:59,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-12 02:13:59,585 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-12 02:13:59,586 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-12 02:13:59,608 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:13:59,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-12 02:13:59,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:13:59,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:13:59,629 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:13:59,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-12 02:13:59,638 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 [2023-11-12 02:13:59,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:13:59,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:13:59,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:13:59,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:13:59,655 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-12 02:13:59,655 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-12 02:13:59,668 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:13:59,672 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-11-12 02:13:59,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:13:59,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:13:59,674 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:13:59,688 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 [2023-11-12 02:13:59,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:13:59,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:13:59,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:13:59,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:13:59,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-12 02:13:59,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-12 02:13:59,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-12 02:13:59,744 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:13:59,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-11-12 02:13:59,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:13:59,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:13:59,754 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:13:59,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-12 02:13:59,761 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 [2023-11-12 02:13:59,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:13:59,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:13:59,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:13:59,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:13:59,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-12 02:13:59,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-12 02:13:59,796 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:13:59,805 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-11-12 02:13:59,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:13:59,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:13:59,821 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:13:59,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-12 02:13:59,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 [2023-11-12 02:13:59,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:13:59,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:13:59,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:13:59,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:13:59,841 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-12 02:13:59,841 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-12 02:13:59,856 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:13:59,873 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-11-12 02:13:59,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:13:59,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:13:59,875 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:13:59,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-12 02:13:59,907 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 [2023-11-12 02:13:59,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:13:59,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:13:59,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:13:59,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:13:59,949 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-12 02:13:59,949 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-12 02:13:59,976 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-12 02:14:00,056 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-11-12 02:14:00,057 INFO L444 ModelExtractionUtils]: 2 out of 25 variables were initially zero. Simplification set additionally 20 variables to zero. [2023-11-12 02:14:00,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:14:00,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:00,107 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:14:00,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-12 02:14:00,113 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-12 02:14:00,135 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-12 02:14:00,135 INFO L513 LassoAnalysis]: Proved termination. [2023-11-12 02:14:00,136 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 [] [2023-11-12 02:14:00,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-11-12 02:14:00,208 INFO L156 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2023-11-12 02:14:00,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:00,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-12 02:14:00,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:14:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:00,293 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 02:14:00,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:14:00,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:14:00,344 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-11-12 02:14:00,346 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 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) [2023-11-12 02:14:00,424 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 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 73 states and 107 transitions. Complement of second has 8 states. [2023-11-12 02:14:00,426 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 [2023-11-12 02:14:00,432 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) [2023-11-12 02:14:00,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2023-11-12 02:14:00,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 2 letters. Loop has 2 letters. [2023-11-12 02:14:00,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:14:00,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 4 letters. Loop has 2 letters. [2023-11-12 02:14:00,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:14:00,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 2 letters. Loop has 4 letters. [2023-11-12 02:14:00,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:14:00,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 107 transitions. [2023-11-12 02:14:00,449 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2023-11-12 02:14:00,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 34 states and 48 transitions. [2023-11-12 02:14:00,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2023-11-12 02:14:00,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2023-11-12 02:14:00,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 48 transitions. [2023-11-12 02:14:00,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:14:00,456 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 48 transitions. [2023-11-12 02:14:00,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 48 transitions. [2023-11-12 02:14:00,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-11-12 02:14:00,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.411764705882353) internal successors, (48), 33 states have internal predecessors, (48), 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) [2023-11-12 02:14:00,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2023-11-12 02:14:00,484 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 48 transitions. [2023-11-12 02:14:00,484 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 48 transitions. [2023-11-12 02:14:00,485 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-12 02:14:00,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 48 transitions. [2023-11-12 02:14:00,486 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2023-11-12 02:14:00,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:14:00,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:14:00,486 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:14:00,487 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-12 02:14:00,487 INFO L748 eck$LassoCheckResult]: Stem: 250#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);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);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);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; 224#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#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~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 225#L19-3 assume !(init_~i~0#1 < 2); 246#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 241#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 242#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 219#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~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#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; 220#L27-3 [2023-11-12 02:14:00,487 INFO L750 eck$LassoCheckResult]: Loop: 220#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 249#L28 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 228#L27-2 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 220#L27-3 [2023-11-12 02:14:00,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:00,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1807951404, now seen corresponding path program 1 times [2023-11-12 02:14:00,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:00,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712692860] [2023-11-12 02:14:00,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:00,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:14:00,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:00,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712692860] [2023-11-12 02:14:00,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712692860] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:00,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:14:00,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:14:00,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563196510] [2023-11-12 02:14:00,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:00,557 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:14:00,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:00,558 INFO L85 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 1 times [2023-11-12 02:14:00,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:00,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328337854] [2023-11-12 02:14:00,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:00,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:00,564 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:14:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:00,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:14:00,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:00,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:14:00,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:14:00,635 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. cyclomatic complexity: 19 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) [2023-11-12 02:14:00,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:00,655 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2023-11-12 02:14:00,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2023-11-12 02:14:00,657 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2023-11-12 02:14:00,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 37 transitions. [2023-11-12 02:14:00,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2023-11-12 02:14:00,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2023-11-12 02:14:00,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2023-11-12 02:14:00,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:14:00,658 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2023-11-12 02:14:00,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2023-11-12 02:14:00,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2023-11-12 02:14:00,661 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) [2023-11-12 02:14:00,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2023-11-12 02:14:00,661 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 36 transitions. [2023-11-12 02:14:00,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:14:00,663 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2023-11-12 02:14:00,663 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-12 02:14:00,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2023-11-12 02:14:00,664 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2023-11-12 02:14:00,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:14:00,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:14:00,665 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:14:00,665 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-12 02:14:00,665 INFO L748 eck$LassoCheckResult]: Stem: 315#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);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);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);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; 295#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#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~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 296#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); 288#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 289#L19-3 assume !(init_~i~0#1 < 2); 312#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 308#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 309#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 290#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~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#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; 291#L27-3 [2023-11-12 02:14:00,665 INFO L750 eck$LassoCheckResult]: Loop: 291#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 314#L28 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 299#L27-2 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 291#L27-3 [2023-11-12 02:14:00,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:00,665 INFO L85 PathProgramCache]: Analyzing trace with hash -369325334, now seen corresponding path program 1 times [2023-11-12 02:14:00,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:00,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219352435] [2023-11-12 02:14:00,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:00,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:00,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:14:00,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:00,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219352435] [2023-11-12 02:14:00,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219352435] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:14:00,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321479083] [2023-11-12 02:14:00,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:00,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:14:00,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:00,761 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:14:00,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-12 02:14:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:00,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-12 02:14:00,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:14:00,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-11-12 02:14:00,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:14:00,902 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:14:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:14:00,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321479083] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:14:00,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:14:00,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-11-12 02:14:00,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045451714] [2023-11-12 02:14:00,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:14:00,929 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:14:00,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:00,932 INFO L85 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 2 times [2023-11-12 02:14:00,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:00,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222029754] [2023-11-12 02:14:00,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:00,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:00,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:14:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:00,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:14:01,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:01,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:14:01,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:14:01,025 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) [2023-11-12 02:14:01,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:01,065 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2023-11-12 02:14:01,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2023-11-12 02:14:01,068 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2023-11-12 02:14:01,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2023-11-12 02:14:01,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2023-11-12 02:14:01,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2023-11-12 02:14:01,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2023-11-12 02:14:01,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:14:01,071 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2023-11-12 02:14:01,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2023-11-12 02:14:01,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-12 02:14:01,074 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) [2023-11-12 02:14:01,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2023-11-12 02:14:01,075 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2023-11-12 02:14:01,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:14:01,078 INFO L428 stractBuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2023-11-12 02:14:01,079 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-12 02:14:01,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2023-11-12 02:14:01,082 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2023-11-12 02:14:01,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:14:01,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:14:01,083 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:14:01,083 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-12 02:14:01,083 INFO L748 eck$LassoCheckResult]: Stem: 429#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);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);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);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; 411#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#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~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 412#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); 402#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 403#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); 430#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 431#L19-3 assume !(init_~i~0#1 < 2); 426#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 422#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 423#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 407#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~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#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; 408#L27-3 [2023-11-12 02:14:01,084 INFO L750 eck$LassoCheckResult]: Loop: 408#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 428#L28 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 413#L27-2 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 408#L27-3 [2023-11-12 02:14:01,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:01,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1083197400, now seen corresponding path program 2 times [2023-11-12 02:14:01,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:01,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534162544] [2023-11-12 02:14:01,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:01,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:01,149 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:14:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:01,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:14:01,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:01,187 INFO L85 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 3 times [2023-11-12 02:14:01,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:01,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148446900] [2023-11-12 02:14:01,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:01,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:01,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:14:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:01,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:14:01,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:01,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1444415621, now seen corresponding path program 1 times [2023-11-12 02:14:01,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:01,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160330486] [2023-11-12 02:14:01,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:01,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:01,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:14:01,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:01,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160330486] [2023-11-12 02:14:01,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160330486] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:14:01,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529828285] [2023-11-12 02:14:01,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:01,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:14:01,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:01,844 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:14:01,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-12 02:14:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:01,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-12 02:14:01,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:14:02,037 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-12 02:14:02,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:02,044 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 02:14:02,051 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-12 02:14:02,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:02,059 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 02:14:02,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:02,162 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-12 02:14:02,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:02,174 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-12 02:14:02,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:02,185 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-12 02:14:02,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:02,205 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 02:14:02,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:14:02,506 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:14:02,864 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:14:02,865 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2023-11-12 02:14:02,874 INFO L351 Elim1Store]: Elim1 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 5 treesize of output 3 [2023-11-12 02:14:02,879 INFO L351 Elim1Store]: Elim1 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 54 treesize of output 50 [2023-11-12 02:14:02,889 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:14:02,890 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2023-11-12 02:14:02,920 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:14:02,925 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 02:14:02,926 INFO L351 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2023-11-12 02:14:02,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:14:02,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529828285] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:14:02,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:14:02,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2023-11-12 02:14:02,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498831490] [2023-11-12 02:14:02,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:14:03,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:03,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-12 02:14:03,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=361, Unknown=3, NotChecked=0, Total=462 [2023-11-12 02:14:03,032 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. cyclomatic complexity: 13 Second operand has 22 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 21 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) [2023-11-12 02:14:03,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:03,440 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2023-11-12 02:14:03,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2023-11-12 02:14:03,440 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-12 02:14:03,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 35 transitions. [2023-11-12 02:14:03,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2023-11-12 02:14:03,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2023-11-12 02:14:03,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2023-11-12 02:14:03,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:14:03,442 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-11-12 02:14:03,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2023-11-12 02:14:03,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-12 02:14:03,444 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) [2023-11-12 02:14:03,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-11-12 02:14:03,444 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-11-12 02:14:03,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:14:03,446 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-11-12 02:14:03,446 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-12 02:14:03,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2023-11-12 02:14:03,446 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-12 02:14:03,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:14:03,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:14:03,447 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:14:03,447 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-12 02:14:03,448 INFO L748 eck$LassoCheckResult]: Stem: 602#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);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);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);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; 583#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#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~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 584#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); 576#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 577#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); 603#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 604#L19-3 assume !(init_~i~0#1 < 2); 599#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 595#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 596#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 578#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~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#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; 579#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 601#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#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); 597#L25 havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;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~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#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; 594#L27-7 [2023-11-12 02:14:03,448 INFO L750 eck$LassoCheckResult]: Loop: 594#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 587#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 589#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 594#L27-7 [2023-11-12 02:14:03,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:03,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1444415679, now seen corresponding path program 1 times [2023-11-12 02:14:03,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:03,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170515730] [2023-11-12 02:14:03,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:03,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:03,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:14:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:03,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:14:03,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:03,505 INFO L85 PathProgramCache]: Analyzing trace with hash 81589, now seen corresponding path program 1 times [2023-11-12 02:14:03,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:03,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104125707] [2023-11-12 02:14:03,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:03,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:03,509 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:14:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:03,516 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:14:03,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:03,517 INFO L85 PathProgramCache]: Analyzing trace with hash 689897333, now seen corresponding path program 1 times [2023-11-12 02:14:03,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:03,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599882754] [2023-11-12 02:14:03,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:03,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:03,554 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:14:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:03,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:14:39,493 WARN L293 SmtUtils]: Spent 35.85s on a formula simplification. DAG size of input: 281 DAG size of output: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-12 02:14:41,223 INFO L210 LassoAnalysis]: Preferences: [2023-11-12 02:14:41,223 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-12 02:14:41,223 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-12 02:14:41,223 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-12 02:14:41,223 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-12 02:14:41,223 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:14:41,223 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-12 02:14:41,223 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-12 02:14:41,223 INFO L133 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration5_Lasso [2023-11-12 02:14:41,223 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-12 02:14:41,224 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-12 02:14:41,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:14:41,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:14:41,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:14:41,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:14:41,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:14:41,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:14:41,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:14:41,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:14:41,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:14:41,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:14:41,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:14:41,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:14:41,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:14:41,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:14:41,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:14:41,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:14:41,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:14:41,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:14:41,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:14:41,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:14:41,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:14:41,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:14:41,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:14:41,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:14:41,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:14:41,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:14:41,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:14:42,407 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-12 02:14:42,407 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-12 02:14:42,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:14:42,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:42,410 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:14:42,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-12 02:14:42,413 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 [2023-11-12 02:14:42,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:14:42,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:14:42,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:14:42,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:14:42,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-12 02:14:42,425 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-12 02:14:42,433 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:14:42,437 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-11-12 02:14:42,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:14:42,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:42,438 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:14:42,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-12 02:14:42,441 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 [2023-11-12 02:14:42,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:14:42,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:14:42,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:14:42,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:14:42,453 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-12 02:14:42,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-12 02:14:42,470 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:14:42,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-11-12 02:14:42,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:14:42,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:42,475 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:14:42,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-12 02:14:42,482 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 [2023-11-12 02:14:42,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:14:42,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:14:42,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:14:42,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:14:42,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:14:42,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:14:42,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:14:42,494 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:14:42,497 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-11-12 02:14:42,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:14:42,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:42,504 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:14:42,510 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 [2023-11-12 02:14:42,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-11-12 02:14:42,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:14:42,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:14:42,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:14:42,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:14:42,522 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-12 02:14:42,522 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-12 02:14:42,526 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:14:42,533 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2023-11-12 02:14:42,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:14:42,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:42,534 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:14:42,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-11-12 02:14:42,537 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 [2023-11-12 02:14:42,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:14:42,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:14:42,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:14:42,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:14:42,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:14:42,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:14:42,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:14:42,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:14:42,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-11-12 02:14:42,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:14:42,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:42,580 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:14:42,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-11-12 02:14:42,582 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 [2023-11-12 02:14:42,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:14:42,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:14:42,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:14:42,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:14:42,596 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-12 02:14:42,597 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-12 02:14:42,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:14:42,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2023-11-12 02:14:42,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:14:42,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:42,605 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:14:42,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-11-12 02:14:42,608 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 [2023-11-12 02:14:42,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:14:42,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:14:42,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:14:42,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:14:42,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:14:42,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:14:42,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:14:42,622 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:14:42,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-11-12 02:14:42,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:14:42,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:42,627 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:14:42,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-11-12 02:14:42,630 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 [2023-11-12 02:14:42,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:14:42,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:14:42,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:14:42,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:14:42,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-12 02:14:42,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-12 02:14:42,672 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:14:42,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-11-12 02:14:42,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:14:42,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:42,677 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:14:42,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-11-12 02:14:42,682 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 [2023-11-12 02:14:42,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:14:42,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:14:42,693 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-11-12 02:14:42,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:14:42,714 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2023-11-12 02:14:42,715 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-11-12 02:14:42,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:14:42,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-11-12 02:14:42,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:14:42,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:42,796 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:14:42,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-11-12 02:14:42,799 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 [2023-11-12 02:14:42,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:14:42,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:14:42,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:14:42,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:14:42,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-12 02:14:42,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-12 02:14:42,814 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:14:42,821 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2023-11-12 02:14:42,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:14:42,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:42,823 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:14:42,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-11-12 02:14:42,826 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 [2023-11-12 02:14:42,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:14:42,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:14:42,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:14:42,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:14:42,841 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-12 02:14:42,841 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-12 02:14:42,880 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-12 02:14:42,921 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2023-11-12 02:14:42,922 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2023-11-12 02:14:42,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:14:42,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:42,926 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:14:42,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-11-12 02:14:42,929 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-12 02:14:42,940 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-12 02:14:42,940 INFO L513 LassoAnalysis]: Proved termination. [2023-11-12 02:14:42,940 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~i~1#1, v_rep(select #length 4)_2) = -8*ULTIMATE.start_f_~i~1#1 + 3*v_rep(select #length 4)_2 Supporting invariants [] [2023-11-12 02:14:42,944 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-11-12 02:14:42,993 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2023-11-12 02:14:42,996 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[4] could not be translated [2023-11-12 02:14:43,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 02:14:43,081 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:14:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,158 WARN L260 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-12 02:14:43,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:14:43,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:14:43,205 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2023-11-12 02:14:43,205 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10 Second operand has 4 states, 4 states have (on average 3.75) 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) [2023-11-12 02:14:43,278 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10. Second operand has 4 states, 4 states have (on average 3.75) 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 35 states and 44 transitions. Complement of second has 8 states. [2023-11-12 02:14:43,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-12 02:14:43,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) 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) [2023-11-12 02:14:43,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2023-11-12 02:14:43,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 14 letters. Loop has 3 letters. [2023-11-12 02:14:43,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:14:43,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 17 letters. Loop has 3 letters. [2023-11-12 02:14:43,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:14:43,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 14 letters. Loop has 6 letters. [2023-11-12 02:14:43,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:14:43,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2023-11-12 02:14:43,288 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-12 02:14:43,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 32 states and 40 transitions. [2023-11-12 02:14:43,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2023-11-12 02:14:43,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2023-11-12 02:14:43,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 40 transitions. [2023-11-12 02:14:43,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:14:43,291 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 40 transitions. [2023-11-12 02:14:43,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 40 transitions. [2023-11-12 02:14:43,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2023-11-12 02:14:43,296 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) [2023-11-12 02:14:43,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2023-11-12 02:14:43,297 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 39 transitions. [2023-11-12 02:14:43,297 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2023-11-12 02:14:43,297 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-12 02:14:43,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2023-11-12 02:14:43,298 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-12 02:14:43,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:14:43,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:14:43,299 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:14:43,300 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-12 02:14:43,300 INFO L748 eck$LassoCheckResult]: Stem: 797#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);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);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);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; 778#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#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~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 779#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); 769#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 770#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); 798#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 799#L19-3 assume !(init_~i~0#1 < 2); 794#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 789#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 790#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 771#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~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#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; 772#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 796#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#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); 791#L25 havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;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~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#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; 792#L27-7 assume !(f_~i~1#1 < 2); 781#L25-1 havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;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~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#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; 773#L38-3 [2023-11-12 02:14:43,306 INFO L750 eck$LassoCheckResult]: Loop: 773#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 775#L39 assume !(g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset);havoc g_#t~mem8#1.base, g_#t~mem8#1.offset; 786#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 773#L38-3 [2023-11-12 02:14:43,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:43,307 INFO L85 PathProgramCache]: Analyzing trace with hash -809029298, now seen corresponding path program 1 times [2023-11-12 02:14:43,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:43,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754853578] [2023-11-12 02:14:43,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:43,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 02:14:43,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:43,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754853578] [2023-11-12 02:14:43,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754853578] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:43,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:14:43,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:14:43,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709175208] [2023-11-12 02:14:43,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:43,386 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:14:43,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:43,386 INFO L85 PathProgramCache]: Analyzing trace with hash 100872, now seen corresponding path program 1 times [2023-11-12 02:14:43,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:43,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894380458] [2023-11-12 02:14:43,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:43,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:43,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:14:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:43,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:14:43,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:43,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:14:43,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:14:43,469 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) [2023-11-12 02:14:43,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:43,496 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2023-11-12 02:14:43,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2023-11-12 02:14:43,497 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-12 02:14:43,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 42 transitions. [2023-11-12 02:14:43,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2023-11-12 02:14:43,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2023-11-12 02:14:43,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2023-11-12 02:14:43,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:14:43,499 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 42 transitions. [2023-11-12 02:14:43,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2023-11-12 02:14:43,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2023-11-12 02:14:43,502 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) [2023-11-12 02:14:43,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2023-11-12 02:14:43,502 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-11-12 02:14:43,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:14:43,504 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-11-12 02:14:43,504 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-12 02:14:43,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2023-11-12 02:14:43,505 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-12 02:14:43,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:14:43,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:14:43,506 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:14:43,506 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-12 02:14:43,507 INFO L748 eck$LassoCheckResult]: Stem: 869#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);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);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);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; 850#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#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~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 851#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); 841#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 842#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); 870#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 871#L19-3 assume !(init_~i~0#1 < 2); 866#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 861#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 862#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 843#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~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#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; 844#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 868#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#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); 863#L25 havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;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~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#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; 864#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 852#L28-1 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#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); 853#L25-1 havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;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~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#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; 845#L38-3 [2023-11-12 02:14:43,507 INFO L750 eck$LassoCheckResult]: Loop: 845#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 847#L39 assume !(g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset);havoc g_#t~mem8#1.base, g_#t~mem8#1.offset; 858#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 845#L38-3 [2023-11-12 02:14:43,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:43,507 INFO L85 PathProgramCache]: Analyzing trace with hash 689897275, now seen corresponding path program 1 times [2023-11-12 02:14:43,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:43,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510893545] [2023-11-12 02:14:43,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:43,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:43,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-11-12 02:14:44,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 02:14:44,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:44,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510893545] [2023-11-12 02:14:44,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510893545] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:14:44,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:14:44,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 02:14:44,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964057317] [2023-11-12 02:14:44,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:14:44,098 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:14:44,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:44,099 INFO L85 PathProgramCache]: Analyzing trace with hash 100872, now seen corresponding path program 2 times [2023-11-12 02:14:44,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:44,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061523215] [2023-11-12 02:14:44,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:44,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:44,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:14:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:44,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:14:44,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:44,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 02:14:44,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:14:44,174 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) [2023-11-12 02:14:44,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:44,403 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2023-11-12 02:14:44,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 55 transitions. [2023-11-12 02:14:44,403 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2023-11-12 02:14:44,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 54 transitions. [2023-11-12 02:14:44,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2023-11-12 02:14:44,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2023-11-12 02:14:44,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2023-11-12 02:14:44,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:14:44,405 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 54 transitions. [2023-11-12 02:14:44,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2023-11-12 02:14:44,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2023-11-12 02:14:44,409 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) [2023-11-12 02:14:44,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-11-12 02:14:44,410 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-11-12 02:14:44,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 02:14:44,411 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-11-12 02:14:44,411 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-12 02:14:44,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2023-11-12 02:14:44,412 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-12 02:14:44,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:14:44,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:14:44,413 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:14:44,413 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-12 02:14:44,413 INFO L748 eck$LassoCheckResult]: Stem: 966#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);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);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);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; 947#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#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~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 948#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); 938#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 939#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); 967#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 968#L19-3 assume !(init_~i~0#1 < 2); 963#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 958#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 959#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 943#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~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#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; 944#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 965#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#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); 960#L25 havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;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~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#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; 961#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 951#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 952#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 957#L27-7 assume !(f_~i~1#1 < 2); 950#L25-1 havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;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~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#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; 940#L38-3 [2023-11-12 02:14:44,413 INFO L750 eck$LassoCheckResult]: Loop: 940#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 942#L39 assume !(g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset);havoc g_#t~mem8#1.base, g_#t~mem8#1.offset; 955#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 940#L38-3 [2023-11-12 02:14:44,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:44,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1566375042, now seen corresponding path program 1 times [2023-11-12 02:14:44,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:44,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922490279] [2023-11-12 02:14:44,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:44,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:44,483 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 02:14:44,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:44,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922490279] [2023-11-12 02:14:44,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922490279] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:14:44,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418469707] [2023-11-12 02:14:44,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:44,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:14:44,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:44,485 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:14:44,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-11-12 02:14:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:44,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-12 02:14:44,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:14:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 02:14:44,635 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:14:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 02:14:44,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418469707] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:14:44,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:14:44,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-11-12 02:14:44,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623193889] [2023-11-12 02:14:44,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:14:44,653 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:14:44,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:44,654 INFO L85 PathProgramCache]: Analyzing trace with hash 100872, now seen corresponding path program 3 times [2023-11-12 02:14:44,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:44,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732409071] [2023-11-12 02:14:44,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:44,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:44,658 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:14:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:44,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:14:44,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:44,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:14:44,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:14:44,728 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) [2023-11-12 02:14:44,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:44,759 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2023-11-12 02:14:44,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2023-11-12 02:14:44,760 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-12 02:14:44,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 42 transitions. [2023-11-12 02:14:44,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2023-11-12 02:14:44,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2023-11-12 02:14:44,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2023-11-12 02:14:44,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:14:44,762 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 42 transitions. [2023-11-12 02:14:44,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2023-11-12 02:14:44,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2023-11-12 02:14:44,772 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) [2023-11-12 02:14:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2023-11-12 02:14:44,775 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 41 transitions. [2023-11-12 02:14:44,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:14:44,778 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2023-11-12 02:14:44,778 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-12 02:14:44,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2023-11-12 02:14:44,779 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-12 02:14:44,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:14:44,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:14:44,781 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:14:44,781 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-12 02:14:44,782 INFO L748 eck$LassoCheckResult]: Stem: 1148#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);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);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);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; 1129#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#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~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1130#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); 1120#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1121#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); 1151#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1152#L19-3 assume !(init_~i~0#1 < 2); 1145#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1140#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1141#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1122#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~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#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; 1123#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1147#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#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); 1142#L25 havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;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~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#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; 1143#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1149#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 1153#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 1150#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1131#L28-1 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#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); 1132#L25-1 havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;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~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#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; 1124#L38-3 [2023-11-12 02:14:44,782 INFO L750 eck$LassoCheckResult]: Loop: 1124#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1126#L39 assume !(g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset);havoc g_#t~mem8#1.base, g_#t~mem8#1.offset; 1137#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 1124#L38-3 [2023-11-12 02:14:44,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:44,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1312987783, now seen corresponding path program 1 times [2023-11-12 02:14:44,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:44,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707426177] [2023-11-12 02:14:44,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:44,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:44,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:14:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:44,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:14:44,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:44,915 INFO L85 PathProgramCache]: Analyzing trace with hash 100872, now seen corresponding path program 4 times [2023-11-12 02:14:44,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:44,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282668756] [2023-11-12 02:14:44,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:44,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:44,920 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:14:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:44,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:14:44,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:44,926 INFO L85 PathProgramCache]: Analyzing trace with hash 951949762, now seen corresponding path program 1 times [2023-11-12 02:14:44,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:44,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710043557] [2023-11-12 02:14:44,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:44,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:46,314 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 02:14:46,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:46,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710043557] [2023-11-12 02:14:46,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710043557] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:14:46,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956695851] [2023-11-12 02:14:46,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:46,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:14:46,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:46,317 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:14:46,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-11-12 02:14:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:46,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-12 02:14:46,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:14:46,774 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-12 02:14:46,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:46,781 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 02:14:46,798 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-12 02:14:46,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:46,806 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 02:14:47,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:47,111 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-12 02:14:47,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:47,120 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-12 02:14:47,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:47,128 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 02:14:47,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:47,134 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 02:14:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 02:14:47,286 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:14:47,932 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:14:47,933 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2023-11-12 02:14:47,937 INFO L351 Elim1Store]: Elim1 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 54 treesize of output 50 [2023-11-12 02:14:47,945 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:14:47,946 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2023-11-12 02:14:47,958 INFO L351 Elim1Store]: Elim1 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 5 treesize of output 3 [2023-11-12 02:14:47,961 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:14:47,966 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:14:47,966 INFO L351 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-12 02:14:47,969 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:14:47,972 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2023-11-12 02:14:47,976 INFO L351 Elim1Store]: Elim1 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 24 treesize of output 20 [2023-11-12 02:14:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 02:14:48,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956695851] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:14:48,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:14:48,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 9] total 33 [2023-11-12 02:14:48,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742651466] [2023-11-12 02:14:48,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:14:48,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:48,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-12 02:14:48,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=945, Unknown=15, NotChecked=0, Total=1122 [2023-11-12 02:14:48,143 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. cyclomatic complexity: 11 Second operand has 34 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 33 states have internal predecessors, (61), 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) [2023-11-12 02:14:49,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:49,286 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2023-11-12 02:14:49,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 50 transitions. [2023-11-12 02:14:49,287 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-12 02:14:49,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 50 transitions. [2023-11-12 02:14:49,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2023-11-12 02:14:49,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2023-11-12 02:14:49,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 50 transitions. [2023-11-12 02:14:49,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:14:49,288 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 50 transitions. [2023-11-12 02:14:49,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 50 transitions. [2023-11-12 02:14:49,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2023-11-12 02:14:49,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 35 states have internal predecessors, (43), 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) [2023-11-12 02:14:49,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2023-11-12 02:14:49,291 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 43 transitions. [2023-11-12 02:14:49,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-12 02:14:49,295 INFO L428 stractBuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2023-11-12 02:14:49,295 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-12 02:14:49,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2023-11-12 02:14:49,295 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-12 02:14:49,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:14:49,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:14:49,297 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:14:49,297 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2023-11-12 02:14:49,298 INFO L748 eck$LassoCheckResult]: Stem: 1421#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);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);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);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; 1398#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#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~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1399#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); 1392#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1393#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); 1424#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1425#L19-3 assume !(init_~i~0#1 < 2); 1418#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1411#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1412#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1396#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~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#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-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1420#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#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); 1413#L25 havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;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~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#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; 1414#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1422#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 1427#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 1423#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1402#L28-1 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#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); 1403#L25-1 havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;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~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#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; 1394#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1395#L39 assume g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset;call g_#t~mem9#1 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1409#L41 [2023-11-12 02:14:49,298 INFO L750 eck$LassoCheckResult]: Loop: 1409#L41 assume 1 == g_#t~mem9#1; 1407#L41-2 havoc g_#t~mem9#1;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1408#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 1417#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1426#L39 assume g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset;call g_#t~mem9#1 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1409#L41 [2023-11-12 02:14:49,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:49,298 INFO L85 PathProgramCache]: Analyzing trace with hash -939123286, now seen corresponding path program 1 times [2023-11-12 02:14:49,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:49,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613624560] [2023-11-12 02:14:49,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:49,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:49,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:14:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:49,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:14:49,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:49,417 INFO L85 PathProgramCache]: Analyzing trace with hash 102421811, now seen corresponding path program 1 times [2023-11-12 02:14:49,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:49,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94813400] [2023-11-12 02:14:49,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:49,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:49,424 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:14:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:14:49,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:14:49,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:49,431 INFO L85 PathProgramCache]: Analyzing trace with hash -289285846, now seen corresponding path program 1 times [2023-11-12 02:14:49,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:49,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650827344] [2023-11-12 02:14:49,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:49,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:50,078 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 02:14:50,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:50,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650827344] [2023-11-12 02:14:50,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650827344] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:14:50,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640944014] [2023-11-12 02:14:50,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:50,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:14:50,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:50,080 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:14:50,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-11-12 02:14:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:50,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-12 02:14:50,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:14:50,654 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-12 02:14:50,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:50,663 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 02:14:50,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:14:50,822 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 02:14:50,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 02:14:50,929 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:14:50,996 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_~#pstate~0.base| v_ArrVal_727) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4 (* |c_ULTIMATE.start_g_~i~2#1| 4))) |c_ULTIMATE.start_g_~pointer#1.offset|))) is different from false [2023-11-12 02:14:51,072 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:14:51,072 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-12 02:14:51,079 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:14:51,080 INFO L351 Elim1Store]: Elim1 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 41 treesize of output 35 [2023-11-12 02:14:51,084 INFO L351 Elim1Store]: Elim1 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 22 treesize of output 18 [2023-11-12 02:14:51,256 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2023-11-12 02:14:51,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640944014] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:14:51,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:14:51,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2023-11-12 02:14:51,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301736044] [2023-11-12 02:14:51,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:14:51,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:14:51,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-12 02:14:51,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=765, Unknown=6, NotChecked=56, Total=930 [2023-11-12 02:14:51,500 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. cyclomatic complexity: 11 Second operand has 31 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 30 states have internal predecessors, (67), 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) [2023-11-12 02:14:53,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:14:53,009 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2023-11-12 02:14:53,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 86 transitions. [2023-11-12 02:14:53,010 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 26 [2023-11-12 02:14:53,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 74 states and 86 transitions. [2023-11-12 02:14:53,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2023-11-12 02:14:53,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2023-11-12 02:14:53,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 86 transitions. [2023-11-12 02:14:53,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:14:53,012 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 86 transitions. [2023-11-12 02:14:53,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 86 transitions. [2023-11-12 02:14:53,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2023-11-12 02:14:53,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 51 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) [2023-11-12 02:14:53,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2023-11-12 02:14:53,016 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 60 transitions. [2023-11-12 02:14:53,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-12 02:14:53,017 INFO L428 stractBuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2023-11-12 02:14:53,017 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-11-12 02:14:53,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 60 transitions. [2023-11-12 02:14:53,017 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-12 02:14:53,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:14:53,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:14:53,018 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:14:53,018 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2023-11-12 02:14:53,019 INFO L748 eck$LassoCheckResult]: Stem: 1769#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);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);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);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; 1746#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#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~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1747#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); 1738#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1739#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); 1773#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1774#L19-3 assume !(init_~i~0#1 < 2); 1766#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1757#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1758#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1742#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~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#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; 1743#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1768#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#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); 1759#L25 havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;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~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#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; 1760#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1770#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 1777#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 1771#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1750#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 1751#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 1756#L27-7 assume !(f_~i~1#1 < 2); 1776#L25-1 havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;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~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#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; 1788#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1775#L39 assume g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset;call g_#t~mem9#1 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1764#L41 [2023-11-12 02:14:53,019 INFO L750 eck$LassoCheckResult]: Loop: 1764#L41 assume 1 == g_#t~mem9#1; 1765#L41-2 havoc g_#t~mem9#1;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1781#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 1778#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1779#L39 assume g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset;call g_#t~mem9#1 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1764#L41 [2023-11-12 02:14:53,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:14:53,019 INFO L85 PathProgramCache]: Analyzing trace with hash -501415375, now seen corresponding path program 1 times [2023-11-12 02:14:53,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:14:53,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802063494] [2023-11-12 02:14:53,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:53,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:14:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:14:53,842 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:14:53,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:14:53,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802063494] [2023-11-12 02:14:53,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802063494] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:14:53,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103020722] [2023-11-12 02:14:53,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:14:53,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:14:53,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:53,847 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:14:53,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34ef03c5-7e1e-43c2-b7c8-a6b9c4438e46/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process