./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu --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 f7b1141c3157e34a4974729c197a93a4b99ad75fc020122df5d99d43bcc85e27 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:44:22,734 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:44:22,862 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-19 07:44:22,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:44:22,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:44:22,915 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:44:22,916 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:44:22,916 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:44:22,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:44:22,923 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:44:22,923 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:44:22,924 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-19 07:44:22,924 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-19 07:44:22,926 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-19 07:44:22,926 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-19 07:44:22,927 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-19 07:44:22,927 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-19 07:44:22,928 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:44:22,928 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-19 07:44:22,929 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:44:22,929 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:44:22,930 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:44:22,930 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:44:22,931 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-19 07:44:22,931 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-19 07:44:22,931 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-19 07:44:22,932 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:44:22,932 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:44:22,933 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:44:22,933 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-19 07:44:22,934 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:44:22,935 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:44:22,935 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:44:22,935 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:44:22,935 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:44:22,936 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-19 07:44:22,936 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_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/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_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu 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 -> f7b1141c3157e34a4974729c197a93a4b99ad75fc020122df5d99d43bcc85e27 [2023-11-19 07:44:23,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:44:23,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:44:23,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:44:23,284 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:44:23,285 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:44:23,286 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2023-11-19 07:44:26,437 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:44:26,784 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:44:26,786 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2023-11-19 07:44:26,802 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/data/9e9e609da/2aa180b126c5485eb58bffb9214247c4/FLAG9fc314337 [2023-11-19 07:44:26,819 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/data/9e9e609da/2aa180b126c5485eb58bffb9214247c4 [2023-11-19 07:44:26,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:44:26,827 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:44:26,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:44:26,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:44:26,838 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:44:26,839 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:44:26" (1/1) ... [2023-11-19 07:44:26,840 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72a20490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:26, skipping insertion in model container [2023-11-19 07:44:26,840 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:44:26" (1/1) ... [2023-11-19 07:44:26,895 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:44:27,307 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:44:27,320 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:44:27,356 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:44:27,393 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:44:27,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:27 WrapperNode [2023-11-19 07:44:27,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:44:27,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:44:27,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:44:27,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:44:27,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:27" (1/1) ... [2023-11-19 07:44:27,416 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:27" (1/1) ... [2023-11-19 07:44:27,439 INFO L138 Inliner]: procedures = 126, calls = 33, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 89 [2023-11-19 07:44:27,440 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:44:27,440 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:44:27,440 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:44:27,441 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:44:27,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:27" (1/1) ... [2023-11-19 07:44:27,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:27" (1/1) ... [2023-11-19 07:44:27,454 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:27" (1/1) ... [2023-11-19 07:44:27,454 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:27" (1/1) ... [2023-11-19 07:44:27,463 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:27" (1/1) ... [2023-11-19 07:44:27,466 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:27" (1/1) ... [2023-11-19 07:44:27,468 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:27" (1/1) ... [2023-11-19 07:44:27,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:27" (1/1) ... [2023-11-19 07:44:27,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:44:27,474 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:44:27,474 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:44:27,474 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:44:27,475 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:27" (1/1) ... [2023-11-19 07:44:27,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:44:27,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:44:27,509 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:44:27,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-19 07:44:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 07:44:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:44:27,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:44:27,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 07:44:27,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 07:44:27,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:44:27,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-19 07:44:27,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:44:27,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:44:27,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:44:27,699 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:44:27,700 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:44:27,931 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:44:27,942 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:44:27,942 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-19 07:44:27,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:44:27 BoogieIcfgContainer [2023-11-19 07:44:27,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:44:27,946 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-19 07:44:27,947 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-19 07:44:27,950 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-19 07:44:27,951 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 07:44:27,951 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 07:44:26" (1/3) ... [2023-11-19 07:44:27,952 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cc73e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 07:44:27, skipping insertion in model container [2023-11-19 07:44:27,953 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 07:44:27,953 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:44:27" (2/3) ... [2023-11-19 07:44:27,953 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cc73e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 07:44:27, skipping insertion in model container [2023-11-19 07:44:27,953 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 07:44:27,953 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:44:27" (3/3) ... [2023-11-19 07:44:27,955 INFO L332 chiAutomizerObserver]: Analyzing ICFG test-0232_1-2.i [2023-11-19 07:44:28,006 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-19 07:44:28,006 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-19 07:44:28,006 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-19 07:44:28,006 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-19 07:44:28,007 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-19 07:44:28,007 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-19 07:44:28,007 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-19 07:44:28,007 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-19 07:44:28,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 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-19 07:44:28,032 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2023-11-19 07:44:28,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:44:28,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:44:28,039 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 07:44:28,040 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-19 07:44:28,040 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-19 07:44:28,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 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-19 07:44:28,045 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2023-11-19 07:44:28,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:44:28,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:44:28,046 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 07:44:28,047 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-19 07:44:28,058 INFO L748 eck$LassoCheckResult]: Stem: 13#$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(16, 2);~c~0 := 0; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; 7#L543-4true [2023-11-19 07:44:28,059 INFO L750 eck$LassoCheckResult]: Loop: 7#L543-4true assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); 3#L534true assume append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4);call append_#t~mem8#1.base, append_#t~mem8#1.offset := read~$Pointer$(append_#t~mem7#1.base, 4 + append_#t~mem7#1.offset, 4);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~mem8#1.base, append_#t~mem8#1.offset; 9#L534-2true call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 4#L529true havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 8#L543-1true havoc main_#t~nondet11#1; 10#L543-2true assume !!(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; 7#L543-4true [2023-11-19 07:44:28,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:28,064 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-19 07:44:28,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:28,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347168732] [2023-11-19 07:44:28,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:28,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:28,167 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:44:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:28,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:44:28,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:28,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1067992523, now seen corresponding path program 1 times [2023-11-19 07:44:28,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:28,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313390175] [2023-11-19 07:44:28,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:28,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:28,307 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:44:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:28,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:44:28,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:28,367 INFO L85 PathProgramCache]: Analyzing trace with hash 148041741, now seen corresponding path program 1 times [2023-11-19 07:44:28,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:28,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965371095] [2023-11-19 07:44:28,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:28,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:28,939 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-19 07:44:28,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:44:28,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965371095] [2023-11-19 07:44:28,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965371095] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:44:28,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:44:28,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:44:28,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873267982] [2023-11-19 07:44:28,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:44:31,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:44:31,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:44:31,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:44:31,973 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 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 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-19 07:44:32,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:44:32,052 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2023-11-19 07:44:32,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2023-11-19 07:44:32,058 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2023-11-19 07:44:32,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 17 transitions. [2023-11-19 07:44:32,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2023-11-19 07:44:32,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2023-11-19 07:44:32,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2023-11-19 07:44:32,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:44:32,069 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 17 transitions. [2023-11-19 07:44:32,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2023-11-19 07:44:32,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2023-11-19 07:44:32,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 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-19 07:44:32,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2023-11-19 07:44:32,095 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2023-11-19 07:44:32,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:44:32,100 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2023-11-19 07:44:32,100 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-19 07:44:32,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2023-11-19 07:44:32,101 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2023-11-19 07:44:32,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:44:32,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:44:32,102 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-19 07:44:32,102 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-19 07:44:32,102 INFO L748 eck$LassoCheckResult]: Stem: 52#$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(16, 2);~c~0 := 0; 53#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; 56#L543-4 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); 51#L534 assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; 46#L534-2 [2023-11-19 07:44:32,102 INFO L750 eck$LassoCheckResult]: Loop: 46#L534-2 call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 47#L529 havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 54#L543-1 havoc main_#t~nondet11#1; 48#L543-2 assume !!(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; 50#L543-4 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); 57#L534 assume append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4);call append_#t~mem8#1.base, append_#t~mem8#1.offset := read~$Pointer$(append_#t~mem7#1.base, 4 + append_#t~mem7#1.offset, 4);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~mem8#1.base, append_#t~mem8#1.offset; 46#L534-2 [2023-11-19 07:44:32,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:32,103 INFO L85 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2023-11-19 07:44:32,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:32,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458554699] [2023-11-19 07:44:32,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:32,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:32,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:44:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:32,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:44:32,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:32,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1274063243, now seen corresponding path program 2 times [2023-11-19 07:44:32,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:32,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807865953] [2023-11-19 07:44:32,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:32,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:32,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:44:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:32,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:44:32,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:32,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1985767406, now seen corresponding path program 1 times [2023-11-19 07:44:32,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:32,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305216002] [2023-11-19 07:44:32,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:32,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:32,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:44:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:32,312 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:44:36,299 INFO L210 LassoAnalysis]: Preferences: [2023-11-19 07:44:36,299 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-19 07:44:36,299 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-19 07:44:36,300 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-19 07:44:36,300 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-19 07:44:36,300 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:44:36,300 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-19 07:44:36,300 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-19 07:44:36,301 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-0232_1-2.i_Iteration2_Lasso [2023-11-19 07:44:36,301 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-19 07:44:36,301 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-19 07:44:36,328 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-19 07:44:36,337 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-19 07:44:36,342 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-19 07:44:36,344 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-19 07:44:36,346 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-19 07:44:36,349 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-19 07:44:36,352 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-19 07:44:36,356 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-19 07:44:36,359 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-19 07:44:36,363 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-19 07:44:36,367 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-19 07:44:36,370 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-19 07:44:36,373 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-19 07:44:36,375 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-19 07:44:36,377 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-19 07:44:36,380 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-19 07:44:36,382 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-19 07:44:36,384 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-19 07:44:36,390 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-19 07:44:36,392 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-19 07:44:36,395 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-19 07:44:36,397 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-19 07:44:36,399 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-19 07:44:36,403 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-19 07:44:38,185 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-19 07:44:38,188 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-19 07:44:38,191 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-19 07:44:38,193 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-19 07:44:38,195 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-19 07:44:38,197 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-19 07:44:38,202 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-19 07:44:38,206 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-19 07:44:38,208 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-19 07:44:38,211 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-19 07:44:38,213 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-19 07:44:38,217 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-19 07:44:38,220 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-19 07:44:42,348 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-19 07:44:42,353 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-19 07:44:42,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:44:42,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:44:42,360 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:44:42,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-19 07:44:42,366 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-19 07:44:42,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:44:42,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:44:42,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:44:42,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:44:42,383 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 07:44:42,384 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 07:44:42,436 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:44:42,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:44:42,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:44:42,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:44:42,463 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:44:42,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-19 07:44:42,473 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-19 07:44:42,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:44:42,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:44:42,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:44:42,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:44:42,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 07:44:42,490 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 07:44:42,508 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:44:42,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-19 07:44:42,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:44:42,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:44:42,537 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:44:42,544 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-19 07:44:42,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:44:42,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:44:42,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:44:42,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:44:42,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:44:42,558 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:44:42,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:44:42,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-19 07:44:42,576 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:44:42,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-19 07:44:42,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:44:42,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:44:42,598 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:44:42,605 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-19 07:44:42,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:44:42,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:44:42,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:44:42,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:44:42,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:44:42,618 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:44:42,618 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:44:42,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-19 07:44:42,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:44:42,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-19 07:44:42,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:44:42,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:44:42,663 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:44:42,670 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-19 07:44:42,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:44:42,682 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:44:42,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:44:42,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:44:42,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:44:42,683 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:44:42,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:44:42,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-19 07:44:42,700 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:44:42,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-11-19 07:44:42,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:44:42,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:44:42,726 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:44:42,734 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-19 07:44:42,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:44:42,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:44:42,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:44:42,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:44:42,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:44:42,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:44:42,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:44:42,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-19 07:44:42,776 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:44:42,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-11-19 07:44:42,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:44:42,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:44:42,797 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:44:42,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-19 07:44:42,800 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-19 07:44:42,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:44:42,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:44:42,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:44:42,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:44:42,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:44:42,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:44:42,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:44:42,836 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:44:42,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-11-19 07:44:42,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:44:42,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:44:42,867 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:44:42,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-19 07:44:42,874 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-19 07:44:42,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:44:42,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:44:42,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:44:42,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:44:42,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:44:42,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:44:42,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:44:42,889 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:44:42,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-19 07:44:42,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:44:42,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:44:42,902 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:44:42,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-19 07:44:42,904 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-19 07:44:42,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:44:42,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:44:42,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:44:42,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:44:42,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:44:42,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:44:42,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:44:42,948 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:44:42,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-11-19 07:44:42,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:44:42,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:44:42,975 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:44:42,990 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-19 07:44:43,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:44:43,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:44:43,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:44:43,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:44:43,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:44:43,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:44:43,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:44:43,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-19 07:44:43,020 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:44:43,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-11-19 07:44:43,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:44:43,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:44:43,035 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:44:43,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-19 07:44:43,038 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-19 07:44:43,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:44:43,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:44:43,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:44:43,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:44:43,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:44:43,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:44:43,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:44:43,050 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:44:43,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-11-19 07:44:43,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:44:43,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:44:43,063 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:44:43,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-19 07:44:43,066 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-19 07:44:43,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:44:43,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:44:43,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:44:43,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:44:43,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 07:44:43,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 07:44:43,088 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:44:43,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-11-19 07:44:43,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:44:43,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:44:43,101 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:44:43,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-19 07:44:43,103 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-19 07:44:43,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:44:43,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:44:43,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:44:43,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:44:43,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:44:43,114 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:44:43,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:44:43,115 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:44:43,127 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-11-19 07:44:43,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:44:43,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:44:43,128 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:44:43,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-19 07:44:43,131 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-19 07:44:43,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:44:43,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:44:43,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:44:43,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:44:43,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:44:43,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:44:43,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:44:43,143 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:44:43,155 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-11-19 07:44:43,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:44:43,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:44:43,156 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:44:43,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-11-19 07:44:43,158 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-19 07:44:43,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:44:43,168 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:44:43,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:44:43,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:44:43,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:44:43,168 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:44:43,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:44:43,170 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:44:43,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-11-19 07:44:43,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:44:43,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:44:43,184 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:44:43,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-11-19 07:44:43,186 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-19 07:44:43,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:44:43,196 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:44:43,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:44:43,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:44:43,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:44:43,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:44:43,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:44:43,198 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:44:43,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-11-19 07:44:43,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:44:43,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:44:43,215 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:44:43,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-19 07:44:43,217 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-19 07:44:43,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:44:43,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 07:44:43,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:44:43,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:44:43,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:44:43,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 07:44:43,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 07:44:43,245 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 07:44:43,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-11-19 07:44:43,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:44:43,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:44:43,262 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:44:43,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-19 07:44:43,263 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-19 07:44:43,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 07:44:43,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 07:44:43,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 07:44:43,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 07:44:43,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 07:44:43,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 07:44:43,304 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-19 07:44:43,340 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-11-19 07:44:43,340 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-11-19 07:44:43,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:44:43,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:44:43,382 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:44:43,390 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-19 07:44:43,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-19 07:44:43,425 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-19 07:44:43,425 INFO L513 LassoAnalysis]: Proved termination. [2023-11-19 07:44:43,425 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~c~0) = -2*~c~0 + 39 Supporting invariants [] [2023-11-19 07:44:43,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-11-19 07:44:43,480 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-11-19 07:44:43,524 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2023-11-19 07:44:43,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:43,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-19 07:44:43,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:44:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:43,628 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-19 07:44:43,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:44:43,668 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-19 07:44:43,672 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-11-19 07:44:43,673 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-19 07:44:43,725 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 21 states and 28 transitions. Complement of second has 6 states. [2023-11-19 07:44:43,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-19 07:44:43,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-19 07:44:43,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2023-11-19 07:44:43,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 6 letters. [2023-11-19 07:44:43,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-19 07:44:43,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 6 letters. [2023-11-19 07:44:43,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-19 07:44:43,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 12 letters. [2023-11-19 07:44:43,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-19 07:44:43,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2023-11-19 07:44:43,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-11-19 07:44:43,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 23 transitions. [2023-11-19 07:44:43,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2023-11-19 07:44:43,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-11-19 07:44:43,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2023-11-19 07:44:43,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-19 07:44:43,741 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2023-11-19 07:44:43,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2023-11-19 07:44:43,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2023-11-19 07:44:43,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 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-19 07:44:43,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2023-11-19 07:44:43,746 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2023-11-19 07:44:43,746 INFO L428 stractBuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2023-11-19 07:44:43,746 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-19 07:44:43,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2023-11-19 07:44:43,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-11-19 07:44:43,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:44:43,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:44:43,751 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:44:43,751 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-11-19 07:44:43,752 INFO L748 eck$LassoCheckResult]: Stem: 183#$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(16, 2);~c~0 := 0; 184#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; 188#L543-4 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); 180#L534 assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; 181#L534-2 call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 173#L529 havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 186#L543-1 havoc main_#t~nondet11#1; 176#L543-2 assume !(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; 177#L543-5 assume !(main_~length~0#1 > 0); 185#L554-1 [2023-11-19 07:44:43,752 INFO L750 eck$LassoCheckResult]: Loop: 185#L554-1 assume !!(main_~length~0#1 > 0);call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_#t~mem19#1.base, main_#t~mem19#1.offset, 4);main_~next~1#1.base, main_~next~1#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem21#1.base, main_#t~mem21#1.offset);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call write~$Pointer$(main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post22#1 := main_~length~0#1;main_~length~0#1 := main_#t~post22#1 - 1;havoc main_#t~post22#1;havoc main_~next~1#1.base, main_~next~1#1.offset; 185#L554-1 [2023-11-19 07:44:43,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:43,752 INFO L85 PathProgramCache]: Analyzing trace with hash 351584945, now seen corresponding path program 1 times [2023-11-19 07:44:43,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:43,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290607958] [2023-11-19 07:44:43,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:43,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:43,872 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-19 07:44:43,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:44:43,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290607958] [2023-11-19 07:44:43,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290607958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:44:43,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:44:43,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:44:43,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388074220] [2023-11-19 07:44:43,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:44:43,873 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-19 07:44:43,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:43,874 INFO L85 PathProgramCache]: Analyzing trace with hash 70, now seen corresponding path program 1 times [2023-11-19 07:44:43,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:43,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300302763] [2023-11-19 07:44:43,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:43,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:43,881 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:44:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:43,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:44:44,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:44:44,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:44:44,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:44:44,057 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-19 07:44:44,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:44:44,076 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2023-11-19 07:44:44,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2023-11-19 07:44:44,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-11-19 07:44:44,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 23 transitions. [2023-11-19 07:44:44,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2023-11-19 07:44:44,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-11-19 07:44:44,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2023-11-19 07:44:44,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-19 07:44:44,078 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-11-19 07:44:44,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2023-11-19 07:44:44,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2023-11-19 07:44:44,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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-19 07:44:44,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-11-19 07:44:44,080 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-11-19 07:44:44,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:44:44,084 INFO L428 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-11-19 07:44:44,086 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-19 07:44:44,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2023-11-19 07:44:44,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-11-19 07:44:44,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:44:44,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:44:44,091 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:44:44,091 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-11-19 07:44:44,092 INFO L748 eck$LassoCheckResult]: Stem: 226#$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(16, 2);~c~0 := 0; 227#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; 231#L543-4 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); 223#L534 assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; 224#L534-2 call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 216#L529 havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 228#L543-1 havoc main_#t~nondet11#1; 219#L543-2 assume !(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; 220#L543-5 assume main_~length~0#1 > 0;call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_#t~mem13#1.base, main_#t~mem13#1.offset, 4);main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_#t~mem15#1.base, 4 + main_#t~mem15#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem16#1.base, main_#t~mem16#1.offset);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem17#1.base, main_#t~mem17#1.offset);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;call write~$Pointer$(main_~next~0#1.base, main_~next~0#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post18#1 := main_~length~0#1;main_~length~0#1 := main_#t~post18#1 - 1;havoc main_#t~post18#1;havoc main_~next~0#1.base, main_~next~0#1.offset; 230#L554-1 [2023-11-19 07:44:44,092 INFO L750 eck$LassoCheckResult]: Loop: 230#L554-1 assume !!(main_~length~0#1 > 0);call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_#t~mem19#1.base, main_#t~mem19#1.offset, 4);main_~next~1#1.base, main_~next~1#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem21#1.base, main_#t~mem21#1.offset);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call write~$Pointer$(main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post22#1 := main_~length~0#1;main_~length~0#1 := main_#t~post22#1 - 1;havoc main_#t~post22#1;havoc main_~next~1#1.base, main_~next~1#1.offset; 230#L554-1 [2023-11-19 07:44:44,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:44,092 INFO L85 PathProgramCache]: Analyzing trace with hash 351584943, now seen corresponding path program 1 times [2023-11-19 07:44:44,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:44,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519583619] [2023-11-19 07:44:44,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:44,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:44,134 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:44:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:44,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:44:44,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:44,157 INFO L85 PathProgramCache]: Analyzing trace with hash 70, now seen corresponding path program 2 times [2023-11-19 07:44:44,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:44,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361906954] [2023-11-19 07:44:44,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:44,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:44,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:44:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:44,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:44:44,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:44,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1985768616, now seen corresponding path program 1 times [2023-11-19 07:44:44,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:44,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733100936] [2023-11-19 07:44:44,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:44,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:44,269 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-19 07:44:44,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:44:44,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733100936] [2023-11-19 07:44:44,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733100936] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:44:44,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:44:44,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:44:44,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682712900] [2023-11-19 07:44:44,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:44:44,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:44:44,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:44:44,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:44:44,423 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-19 07:44:44,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:44:44,443 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2023-11-19 07:44:44,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2023-11-19 07:44:44,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-11-19 07:44:44,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 26 states and 32 transitions. [2023-11-19 07:44:44,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2023-11-19 07:44:44,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2023-11-19 07:44:44,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2023-11-19 07:44:44,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-19 07:44:44,446 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-11-19 07:44:44,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2023-11-19 07:44:44,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2023-11-19 07:44:44,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 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-19 07:44:44,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2023-11-19 07:44:44,448 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2023-11-19 07:44:44,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:44:44,453 INFO L428 stractBuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2023-11-19 07:44:44,453 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-19 07:44:44,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2023-11-19 07:44:44,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-11-19 07:44:44,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:44:44,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:44:44,456 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-11-19 07:44:44,456 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-11-19 07:44:44,456 INFO L748 eck$LassoCheckResult]: Stem: 283#$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(16, 2);~c~0 := 0; 284#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; 289#L543-4 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); 280#L534 assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; 273#L534-2 call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 274#L529 havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 287#L543-1 havoc main_#t~nondet11#1; 278#L543-2 assume !!(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; 279#L543-4 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); 281#L534 assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; 282#L534-2 call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 285#L529 havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 286#L543-1 havoc main_#t~nondet11#1; 276#L543-2 assume !(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; 277#L543-5 assume main_~length~0#1 > 0;call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_#t~mem13#1.base, main_#t~mem13#1.offset, 4);main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_#t~mem15#1.base, 4 + main_#t~mem15#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem16#1.base, main_#t~mem16#1.offset);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem17#1.base, main_#t~mem17#1.offset);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;call write~$Pointer$(main_~next~0#1.base, main_~next~0#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post18#1 := main_~length~0#1;main_~length~0#1 := main_#t~post18#1 - 1;havoc main_#t~post18#1;havoc main_~next~0#1.base, main_~next~0#1.offset; 288#L554-1 [2023-11-19 07:44:44,456 INFO L750 eck$LassoCheckResult]: Loop: 288#L554-1 assume !!(main_~length~0#1 > 0);call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_#t~mem19#1.base, main_#t~mem19#1.offset, 4);main_~next~1#1.base, main_~next~1#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem21#1.base, main_#t~mem21#1.offset);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call write~$Pointer$(main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post22#1 := main_~length~0#1;main_~length~0#1 := main_#t~post22#1 - 1;havoc main_#t~post22#1;havoc main_~next~1#1.base, main_~next~1#1.offset; 288#L554-1 [2023-11-19 07:44:44,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:44,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2017814045, now seen corresponding path program 1 times [2023-11-19 07:44:44,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:44,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536910304] [2023-11-19 07:44:44,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:44,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:44,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:44:44,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:44:44,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536910304] [2023-11-19 07:44:44,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536910304] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:44:44,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100445373] [2023-11-19 07:44:44,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:44,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:44:44,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:44:44,789 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:44:44,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebd919db-3db8-4323-8d1e-d1b8b39b03e7/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-19 07:44:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:44:44,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-19 07:44:44,936 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:44:44,994 INFO L349 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2023-11-19 07:44:44,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 104 [2023-11-19 07:44:45,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-11-19 07:44:45,022 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:44:45,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-19 07:44:45,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:44:45,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 26 [2023-11-19 07:44:45,076 INFO L378 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 16 treesize of output 8 [2023-11-19 07:44:45,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:44:45,081 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:44:45,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:44:45,113 INFO L378 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 286 treesize of output 279 [2023-11-19 07:44:45,123 INFO L378 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 152 treesize of output 144 [2023-11-19 07:44:45,229 INFO L378 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 6 treesize of output 4 [2023-11-19 07:44:45,242 INFO L378 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 6 treesize of output 4 [2023-11-19 07:44:45,249 INFO L378 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 20 treesize of output 18 [2023-11-19 07:44:45,261 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-19 07:44:45,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:44:45,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100445373] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:44:45,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:44:45,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2023-11-19 07:44:45,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831223281] [2023-11-19 07:44:45,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:44:45,276 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-19 07:44:45,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:45,276 INFO L85 PathProgramCache]: Analyzing trace with hash 70, now seen corresponding path program 3 times [2023-11-19 07:44:45,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:45,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613267082] [2023-11-19 07:44:45,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:45,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:45,284 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:44:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:45,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:44:45,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:44:45,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:44:45,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:44:45,456 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-19 07:44:45,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:44:45,517 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2023-11-19 07:44:45,517 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2023-11-19 07:44:45,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-11-19 07:44:45,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2023-11-19 07:44:45,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2023-11-19 07:44:45,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2023-11-19 07:44:45,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2023-11-19 07:44:45,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-19 07:44:45,519 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 18 transitions. [2023-11-19 07:44:45,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2023-11-19 07:44:45,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-11-19 07:44:45,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 states have internal predecessors, (18), 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-19 07:44:45,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2023-11-19 07:44:45,521 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 18 transitions. [2023-11-19 07:44:45,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:44:45,526 INFO L428 stractBuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2023-11-19 07:44:45,527 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-19 07:44:45,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2023-11-19 07:44:45,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-11-19 07:44:45,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:44:45,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:44:45,530 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:44:45,530 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-11-19 07:44:45,531 INFO L748 eck$LassoCheckResult]: Stem: 414#$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(16, 2);~c~0 := 0; 415#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; 419#L543-4 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); 411#L534 assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; 412#L534-2 call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 406#L529 havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 417#L543-1 havoc main_#t~nondet11#1; 409#L543-2 assume !!(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; 410#L543-4 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); 413#L534 assume append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4);call append_#t~mem8#1.base, append_#t~mem8#1.offset := read~$Pointer$(append_#t~mem7#1.base, 4 + append_#t~mem7#1.offset, 4);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~mem8#1.base, append_#t~mem8#1.offset; 403#L534-2 call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 404#L529 havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 416#L543-1 havoc main_#t~nondet11#1; 407#L543-2 assume !(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; 408#L543-5 assume main_~length~0#1 > 0;call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_#t~mem13#1.base, main_#t~mem13#1.offset, 4);main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_#t~mem15#1.base, 4 + main_#t~mem15#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem16#1.base, main_#t~mem16#1.offset);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem17#1.base, main_#t~mem17#1.offset);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;call write~$Pointer$(main_~next~0#1.base, main_~next~0#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post18#1 := main_~length~0#1;main_~length~0#1 := main_#t~post18#1 - 1;havoc main_#t~post18#1;havoc main_~next~0#1.base, main_~next~0#1.offset; 418#L554-1 [2023-11-19 07:44:45,531 INFO L750 eck$LassoCheckResult]: Loop: 418#L554-1 assume !!(main_~length~0#1 > 0);call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_#t~mem19#1.base, main_#t~mem19#1.offset, 4);main_~next~1#1.base, main_~next~1#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem21#1.base, main_#t~mem21#1.offset);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call write~$Pointer$(main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post22#1 := main_~length~0#1;main_~length~0#1 := main_#t~post22#1 - 1;havoc main_#t~post22#1;havoc main_~next~1#1.base, main_~next~1#1.offset; 418#L554-1 [2023-11-19 07:44:45,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:45,532 INFO L85 PathProgramCache]: Analyzing trace with hash -2075072347, now seen corresponding path program 1 times [2023-11-19 07:44:45,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:45,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304971679] [2023-11-19 07:44:45,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:45,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:45,603 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:44:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:45,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:44:45,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:45,670 INFO L85 PathProgramCache]: Analyzing trace with hash 70, now seen corresponding path program 4 times [2023-11-19 07:44:45,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:45,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343047663] [2023-11-19 07:44:45,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:45,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:45,677 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:44:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:45,681 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:44:45,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:44:45,682 INFO L85 PathProgramCache]: Analyzing trace with hash 97266722, now seen corresponding path program 1 times [2023-11-19 07:44:45,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:44:45,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787018490] [2023-11-19 07:44:45,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:44:45,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:44:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:45,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:44:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:44:45,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:45:16,125 WARN L293 SmtUtils]: Spent 30.17s on a formula simplification. DAG size of input: 367 DAG size of output: 298 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)