./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/list-ext-properties/simple-ext.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a0165632 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_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/list-ext-properties/simple-ext.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX --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 79d8454f49f42d774b494771accf13f0b47382db45ac5cfdb4c7afee633f8cd7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:50:54,288 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:50:54,407 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-08 16:50:54,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:50:54,417 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:50:54,449 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:50:54,450 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:50:54,450 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:50:54,451 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:50:54,452 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:50:54,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:50:54,453 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:50:54,454 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:50:54,454 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-08 16:50:54,455 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-08 16:50:54,455 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-08 16:50:54,456 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-08 16:50:54,456 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-08 16:50:54,457 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-08 16:50:54,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:50:54,458 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-08 16:50:54,462 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:50:54,463 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:50:54,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:50:54,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:50:54,464 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-08 16:50:54,464 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-08 16:50:54,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-08 16:50:54,465 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:50:54,465 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 16:50:54,465 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:50:54,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:50:54,468 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-08 16:50:54,469 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:50:54,469 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:50:54,470 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:50:54,471 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:50:54,471 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:50:54,472 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-08 16:50:54,473 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_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/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_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX 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 -> 79d8454f49f42d774b494771accf13f0b47382db45ac5cfdb4c7afee633f8cd7 [2024-11-08 16:50:54,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:50:54,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:50:54,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:50:54,902 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:50:54,903 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:50:54,904 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/list-ext-properties/simple-ext.i Unable to find full path for "g++" [2024-11-08 16:50:57,364 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:50:57,650 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:50:57,650 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/sv-benchmarks/c/list-ext-properties/simple-ext.i [2024-11-08 16:50:57,670 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/data/9dab2221a/24ce67d5afee4ec19cb51d6e89aa8200/FLAG3614639bc [2024-11-08 16:50:57,945 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/data/9dab2221a/24ce67d5afee4ec19cb51d6e89aa8200 [2024-11-08 16:50:57,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:50:57,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:50:57,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:50:57,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:50:57,958 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:50:57,959 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:50:57" (1/1) ... [2024-11-08 16:50:57,961 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@416ec0ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:57, skipping insertion in model container [2024-11-08 16:50:57,961 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:50:57" (1/1) ... [2024-11-08 16:50:58,031 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:50:58,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:50:58,483 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:50:58,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:50:58,580 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:50:58,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:58 WrapperNode [2024-11-08 16:50:58,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:50:58,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:50:58,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:50:58,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:50:58,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:58" (1/1) ... [2024-11-08 16:50:58,614 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:58" (1/1) ... [2024-11-08 16:50:58,648 INFO L138 Inliner]: procedures = 124, calls = 20, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 80 [2024-11-08 16:50:58,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:50:58,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:50:58,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:50:58,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:50:58,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:58" (1/1) ... [2024-11-08 16:50:58,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:58" (1/1) ... [2024-11-08 16:50:58,671 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:58" (1/1) ... [2024-11-08 16:50:58,694 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-11-08 16:50:58,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:58" (1/1) ... [2024-11-08 16:50:58,695 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:58" (1/1) ... [2024-11-08 16:50:58,704 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:58" (1/1) ... [2024-11-08 16:50:58,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:58" (1/1) ... [2024-11-08 16:50:58,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:58" (1/1) ... [2024-11-08 16:50:58,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:58" (1/1) ... [2024-11-08 16:50:58,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:50:58,717 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:50:58,717 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:50:58,717 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:50:58,718 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:58" (1/1) ... [2024-11-08 16:50:58,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 16:50:58,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:50:58,764 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 16:50:58,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-08 16:50:58,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 16:50:58,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 16:50:58,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 16:50:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 16:50:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 16:50:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:50:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 16:50:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 16:50:58,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 16:50:58,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 16:50:58,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 16:50:58,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 16:50:58,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 16:50:58,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:50:58,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:50:58,981 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:50:58,983 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:50:59,223 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-08 16:50:59,223 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:50:59,238 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:50:59,239 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:50:59,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:50:59 BoogieIcfgContainer [2024-11-08 16:50:59,239 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:50:59,240 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-08 16:50:59,241 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-08 16:50:59,245 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-08 16:50:59,246 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-08 16:50:59,247 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.11 04:50:57" (1/3) ... [2024-11-08 16:50:59,248 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@516ebd19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 04:50:59, skipping insertion in model container [2024-11-08 16:50:59,248 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-08 16:50:59,248 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:50:58" (2/3) ... [2024-11-08 16:50:59,249 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@516ebd19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 04:50:59, skipping insertion in model container [2024-11-08 16:50:59,249 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-08 16:50:59,249 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:50:59" (3/3) ... [2024-11-08 16:50:59,251 INFO L332 chiAutomizerObserver]: Analyzing ICFG simple-ext.i [2024-11-08 16:50:59,327 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-08 16:50:59,327 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-08 16:50:59,327 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-08 16:50:59,327 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-08 16:50:59,328 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-08 16:50:59,328 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-08 16:50:59,328 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-08 16:50:59,328 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-08 16:50:59,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:50:59,362 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2024-11-08 16:50:59,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 16:50:59,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 16:50:59,375 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-08 16:50:59,375 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-08 16:50:59,376 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-08 16:50:59,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:50:59,381 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2024-11-08 16:50:59,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 16:50:59,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 16:50:59,384 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-08 16:50:59,385 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-08 16:50:59,394 INFO L745 eck$LassoCheckResult]: Stem: 24#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 18#L533true assume main_~a~0#1.base == 0 && main_~a~0#1.offset == 0;assume { :begin_inline_myexit } true;myexit_#in~s#1 := 1;havoc myexit_~s#1;myexit_~s#1 := myexit_#in~s#1; 2#L525true [2024-11-08 16:50:59,398 INFO L747 eck$LassoCheckResult]: Loop: 2#L525true assume true; 2#L525true [2024-11-08 16:50:59,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:50:59,409 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-08 16:50:59,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:50:59,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365904916] [2024-11-08 16:50:59,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:50:59,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:50:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:50:59,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:50:59,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:50:59,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365904916] [2024-11-08 16:50:59,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365904916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:50:59,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:50:59,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:50:59,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417836292] [2024-11-08 16:50:59,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:50:59,716 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-08 16:50:59,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:50:59,718 INFO L85 PathProgramCache]: Analyzing trace with hash 114, now seen corresponding path program 1 times [2024-11-08 16:50:59,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:50:59,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967828066] [2024-11-08 16:50:59,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:50:59,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:50:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:50:59,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:50:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:50:59,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:50:59,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:50:59,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:50:59,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:50:59,819 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2024-11-08 16:50:59,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:50:59,864 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2024-11-08 16:50:59,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2024-11-08 16:50:59,869 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2024-11-08 16:50:59,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 18 states and 23 transitions. [2024-11-08 16:50:59,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-08 16:50:59,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-08 16:50:59,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2024-11-08 16:50:59,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 16:50:59,881 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-11-08 16:50:59,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2024-11-08 16:50:59,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-08 16:50:59,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 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) [2024-11-08 16:50:59,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2024-11-08 16:50:59,917 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-11-08 16:50:59,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:50:59,924 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-11-08 16:50:59,925 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-08 16:50:59,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2024-11-08 16:50:59,927 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2024-11-08 16:50:59,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 16:50:59,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 16:50:59,929 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-08 16:50:59,929 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-08 16:50:59,929 INFO L745 eck$LassoCheckResult]: Stem: 74#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 70#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 71#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 72#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 63#L537-5 [2024-11-08 16:50:59,930 INFO L747 eck$LassoCheckResult]: Loop: 63#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 64#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 65#L537-3 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 67#L540 assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0); 62#L540-1 call write~$Pointer$#1(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 63#L537-5 [2024-11-08 16:50:59,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:50:59,931 INFO L85 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2024-11-08 16:50:59,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:50:59,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716699620] [2024-11-08 16:50:59,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:50:59,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:50:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:50:59,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:50:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:51:00,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:51:00,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:00,005 INFO L85 PathProgramCache]: Analyzing trace with hash 42089911, now seen corresponding path program 1 times [2024-11-08 16:51:00,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:00,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857875840] [2024-11-08 16:51:00,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:00,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:51:00,093 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:51:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:51:00,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:51:00,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:00,142 INFO L85 PathProgramCache]: Analyzing trace with hash 2098954291, now seen corresponding path program 1 times [2024-11-08 16:51:00,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:00,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614274223] [2024-11-08 16:51:00,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:00,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:51:00,206 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:51:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:51:00,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:51:01,344 INFO L204 LassoAnalysis]: Preferences: [2024-11-08 16:51:01,344 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-08 16:51:01,344 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-08 16:51:01,345 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-08 16:51:01,345 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-08 16:51:01,345 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 16:51:01,345 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-08 16:51:01,345 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-08 16:51:01,346 INFO L132 ssoRankerPreferences]: Filename of dumped script: simple-ext.i_Iteration2_Lasso [2024-11-08 16:51:01,346 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-08 16:51:01,346 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-08 16:51:01,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 16:51:01,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 16:51:01,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 16:51:01,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 16:51:01,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 16:51:01,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 16:51:01,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 16:51:01,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 16:51:01,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 16:51:01,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 16:51:01,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 16:51:01,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 16:51:01,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 16:51:01,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 16:51:01,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 16:51:01,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 16:51:01,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 16:51:01,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 16:51:01,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 16:51:02,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 16:51:02,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 16:51:02,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 16:51:02,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 16:51:02,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 16:51:02,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 16:51:02,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 16:51:02,617 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-08 16:51:02,626 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-08 16:51:02,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 16:51:02,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:51:02,644 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 16:51:02,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-08 16:51:02,655 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 [2024-11-08 16:51:02,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 16:51:02,690 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 16:51:02,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 16:51:02,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 16:51:02,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 16:51:02,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 16:51:02,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 16:51:02,706 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 16:51:02,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-08 16:51:02,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 16:51:02,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:51:02,751 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 16:51:02,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-08 16:51:02,763 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 [2024-11-08 16:51:02,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 16:51:02,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 16:51:02,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 16:51:02,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 16:51:02,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 16:51:02,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 16:51:02,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 16:51:02,786 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 16:51:02,809 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-08 16:51:02,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 16:51:02,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:51:02,812 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 16:51:02,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-08 16:51:02,817 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 [2024-11-08 16:51:02,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 16:51:02,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 16:51:02,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 16:51:02,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 16:51:02,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 16:51:02,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 16:51:02,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 16:51:02,838 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 16:51:02,861 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-08 16:51:02,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 16:51:02,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:51:02,864 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 16:51:02,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-08 16:51:02,867 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 [2024-11-08 16:51:02,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 16:51:02,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 16:51:02,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 16:51:02,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 16:51:02,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 16:51:02,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 16:51:02,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 16:51:02,894 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 16:51:02,910 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-08 16:51:02,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 16:51:02,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:51:02,912 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 16:51:02,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-08 16:51:02,915 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 [2024-11-08 16:51:02,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 16:51:02,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 16:51:02,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 16:51:02,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 16:51:02,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 16:51:02,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 16:51:02,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 16:51:02,931 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 16:51:02,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-08 16:51:02,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 16:51:02,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:51:02,949 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 16:51:02,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-08 16:51:02,952 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 [2024-11-08 16:51:02,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 16:51:02,966 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-08 16:51:02,966 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-08 16:51:02,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 16:51:02,983 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2024-11-08 16:51:02,984 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-08 16:51:03,009 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 16:51:03,032 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-08 16:51:03,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 16:51:03,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:51:03,035 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 16:51:03,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-08 16:51:03,039 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 [2024-11-08 16:51:03,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 16:51:03,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 16:51:03,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 16:51:03,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 16:51:03,064 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-08 16:51:03,065 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-08 16:51:03,071 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 16:51:03,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-08 16:51:03,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 16:51:03,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:51:03,100 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 16:51:03,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-08 16:51:03,105 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 [2024-11-08 16:51:03,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 16:51:03,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 16:51:03,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 16:51:03,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 16:51:03,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 16:51:03,125 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 16:51:03,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 16:51:03,136 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 16:51:03,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-08 16:51:03,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 16:51:03,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:51:03,162 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 16:51:03,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-08 16:51:03,165 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 [2024-11-08 16:51:03,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 16:51:03,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 16:51:03,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 16:51:03,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 16:51:03,185 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-08 16:51:03,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-08 16:51:03,192 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 16:51:03,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-08 16:51:03,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 16:51:03,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:51:03,218 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 16:51:03,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-08 16:51:03,223 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 [2024-11-08 16:51:03,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 16:51:03,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 16:51:03,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 16:51:03,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 16:51:03,244 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-08 16:51:03,244 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-08 16:51:03,253 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 16:51:03,275 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-08 16:51:03,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 16:51:03,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:51:03,278 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 16:51:03,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-08 16:51:03,284 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 [2024-11-08 16:51:03,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 16:51:03,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 16:51:03,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 16:51:03,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 16:51:03,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 16:51:03,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 16:51:03,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 16:51:03,305 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 16:51:03,327 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-08 16:51:03,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 16:51:03,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:51:03,330 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 16:51:03,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-08 16:51:03,333 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 [2024-11-08 16:51:03,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 16:51:03,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 16:51:03,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 16:51:03,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 16:51:03,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-08 16:51:03,355 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-08 16:51:03,361 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 16:51:03,386 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-08 16:51:03,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 16:51:03,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:51:03,388 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 16:51:03,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-08 16:51:03,392 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 [2024-11-08 16:51:03,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 16:51:03,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 16:51:03,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 16:51:03,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 16:51:03,414 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-08 16:51:03,414 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-08 16:51:03,419 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 16:51:03,441 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-08 16:51:03,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 16:51:03,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:51:03,444 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 16:51:03,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-08 16:51:03,451 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 [2024-11-08 16:51:03,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 16:51:03,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 16:51:03,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 16:51:03,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 16:51:03,474 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-08 16:51:03,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-08 16:51:03,482 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-08 16:51:03,503 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-08 16:51:03,503 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-11-08 16:51:03,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 16:51:03,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:51:03,508 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 16:51:03,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-08 16:51:03,511 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-08 16:51:03,531 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-08 16:51:03,531 INFO L474 LassoAnalysis]: Proved termination. [2024-11-08 16:51:03,532 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 59 Supporting invariants [] [2024-11-08 16:51:03,554 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-08 16:51:03,583 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-11-08 16:51:03,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:03,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 16:51:03,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:51:03,733 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-08 16:51:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:03,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 16:51:03,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:51:03,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:51:03,855 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 [2024-11-08 16:51:03,857 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 23 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 2.25) 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) [2024-11-08 16:51:03,974 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 23 transitions. cyclomatic complexity: 9. Second operand has 4 states, 4 states have (on average 2.25) 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) Result 29 states and 38 transitions. Complement of second has 9 states. [2024-11-08 16:51:03,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-08 16:51:03,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) 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) [2024-11-08 16:51:03,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2024-11-08 16:51:03,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 4 letters. Loop has 5 letters. [2024-11-08 16:51:03,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 16:51:03,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 9 letters. Loop has 5 letters. [2024-11-08 16:51:03,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 16:51:03,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 4 letters. Loop has 10 letters. [2024-11-08 16:51:03,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 16:51:03,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2024-11-08 16:51:03,985 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2024-11-08 16:51:03,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 33 transitions. [2024-11-08 16:51:03,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-08 16:51:03,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-08 16:51:03,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2024-11-08 16:51:03,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-08 16:51:03,987 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 33 transitions. [2024-11-08 16:51:03,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2024-11-08 16:51:03,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2024-11-08 16:51:03,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 states have internal predecessors, (29), 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) [2024-11-08 16:51:03,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2024-11-08 16:51:03,990 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2024-11-08 16:51:03,991 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2024-11-08 16:51:03,991 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-08 16:51:03,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2024-11-08 16:51:03,992 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2024-11-08 16:51:03,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 16:51:03,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 16:51:03,993 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:51:03,993 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-08 16:51:03,994 INFO L745 eck$LassoCheckResult]: Stem: 199#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 194#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 195#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 196#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 197#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 185#L537-1 assume !main_#t~short5#1; 186#L537-3 assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; 189#L537-6 call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 192#L549-3 [2024-11-08 16:51:03,994 INFO L747 eck$LassoCheckResult]: Loop: 192#L549-3 assume main_~p~0#1.base != 0 || main_~p~0#1.offset != 0; 180#L549-1 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 182#L550 assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1; 201#L550-2 call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 192#L549-3 [2024-11-08 16:51:03,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:03,995 INFO L85 PathProgramCache]: Analyzing trace with hash 206257400, now seen corresponding path program 1 times [2024-11-08 16:51:03,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:03,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331470680] [2024-11-08 16:51:03,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:03,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:04,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:51:04,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:51:04,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331470680] [2024-11-08 16:51:04,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331470680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:51:04,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:51:04,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:51:04,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246258426] [2024-11-08 16:51:04,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:51:04,113 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-08 16:51:04,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:04,113 INFO L85 PathProgramCache]: Analyzing trace with hash 2191080, now seen corresponding path program 1 times [2024-11-08 16:51:04,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:04,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084783313] [2024-11-08 16:51:04,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:04,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:51:04,123 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:51:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:51:04,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:51:04,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:51:04,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:51:04,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:51:04,287 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. cyclomatic complexity: 11 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) [2024-11-08 16:51:04,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:51:04,351 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2024-11-08 16:51:04,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2024-11-08 16:51:04,353 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2024-11-08 16:51:04,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 48 transitions. [2024-11-08 16:51:04,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-11-08 16:51:04,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2024-11-08 16:51:04,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 48 transitions. [2024-11-08 16:51:04,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-08 16:51:04,355 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 48 transitions. [2024-11-08 16:51:04,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 48 transitions. [2024-11-08 16:51:04,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 24. [2024-11-08 16:51:04,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 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) [2024-11-08 16:51:04,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-08 16:51:04,359 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-08 16:51:04,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:51:04,360 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-08 16:51:04,360 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-08 16:51:04,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2024-11-08 16:51:04,361 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2024-11-08 16:51:04,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 16:51:04,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 16:51:04,362 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:51:04,362 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-08 16:51:04,363 INFO L745 eck$LassoCheckResult]: Stem: 270#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 263#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 264#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 265#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 266#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 254#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 255#L537-3 assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; 258#L537-6 call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 261#L549-3 [2024-11-08 16:51:04,363 INFO L747 eck$LassoCheckResult]: Loop: 261#L549-3 assume main_~p~0#1.base != 0 || main_~p~0#1.offset != 0; 249#L549-1 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 251#L550 assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1; 272#L550-2 call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 261#L549-3 [2024-11-08 16:51:04,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:04,364 INFO L85 PathProgramCache]: Analyzing trace with hash 206255478, now seen corresponding path program 1 times [2024-11-08 16:51:04,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:04,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762098550] [2024-11-08 16:51:04,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:04,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:51:04,394 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:51:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:51:04,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:51:04,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:04,423 INFO L85 PathProgramCache]: Analyzing trace with hash 2191080, now seen corresponding path program 2 times [2024-11-08 16:51:04,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:04,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657277461] [2024-11-08 16:51:04,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:04,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:51:04,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:51:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:51:04,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:51:04,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:04,451 INFO L85 PathProgramCache]: Analyzing trace with hash -533012003, now seen corresponding path program 1 times [2024-11-08 16:51:04,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:04,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922838635] [2024-11-08 16:51:04,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:04,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:04,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:51:04,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:51:04,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922838635] [2024-11-08 16:51:04,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922838635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:51:04,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:51:04,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:51:04,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156156803] [2024-11-08 16:51:04,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:51:04,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:51:04,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:51:04,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:51:04,884 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:51:05,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:51:05,010 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2024-11-08 16:51:05,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 49 transitions. [2024-11-08 16:51:05,012 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-08 16:51:05,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 37 states and 48 transitions. [2024-11-08 16:51:05,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-11-08 16:51:05,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-11-08 16:51:05,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 48 transitions. [2024-11-08 16:51:05,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-08 16:51:05,018 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 48 transitions. [2024-11-08 16:51:05,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 48 transitions. [2024-11-08 16:51:05,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2024-11-08 16:51:05,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:51:05,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2024-11-08 16:51:05,024 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 37 transitions. [2024-11-08 16:51:05,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:51:05,028 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2024-11-08 16:51:05,028 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-08 16:51:05,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2024-11-08 16:51:05,029 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2024-11-08 16:51:05,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 16:51:05,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 16:51:05,029 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:51:05,029 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-08 16:51:05,030 INFO L745 eck$LassoCheckResult]: Stem: 345#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 338#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 339#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 340#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 341#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 330#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 331#L537-3 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 335#L540 assume main_~t~0#1.base == 0 && main_~t~0#1.offset == 0;assume { :begin_inline_myexit } true;myexit_#in~s#1 := 1;havoc myexit_~s#1;myexit_~s#1 := myexit_#in~s#1; 344#L525-1 [2024-11-08 16:51:05,030 INFO L747 eck$LassoCheckResult]: Loop: 344#L525-1 assume true; 344#L525-1 [2024-11-08 16:51:05,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:05,030 INFO L85 PathProgramCache]: Analyzing trace with hash 206255531, now seen corresponding path program 1 times [2024-11-08 16:51:05,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:05,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964025613] [2024-11-08 16:51:05,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:05,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:05,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:51:05,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:51:05,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964025613] [2024-11-08 16:51:05,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964025613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:51:05,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:51:05,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:51:05,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041851663] [2024-11-08 16:51:05,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:51:05,084 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-08 16:51:05,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:05,085 INFO L85 PathProgramCache]: Analyzing trace with hash 115, now seen corresponding path program 1 times [2024-11-08 16:51:05,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:05,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783082876] [2024-11-08 16:51:05,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:05,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:51:05,105 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:51:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:51:05,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:51:05,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:51:05,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:51:05,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:51:05,113 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 13 Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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) [2024-11-08 16:51:05,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:51:05,128 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2024-11-08 16:51:05,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2024-11-08 16:51:05,129 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-08 16:51:05,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 26 states and 33 transitions. [2024-11-08 16:51:05,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-11-08 16:51:05,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-11-08 16:51:05,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2024-11-08 16:51:05,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-08 16:51:05,132 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-08 16:51:05,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2024-11-08 16:51:05,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-08 16:51:05,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 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) [2024-11-08 16:51:05,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-08 16:51:05,137 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-08 16:51:05,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:51:05,139 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-08 16:51:05,141 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-08 16:51:05,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2024-11-08 16:51:05,142 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-08 16:51:05,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 16:51:05,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 16:51:05,142 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:51:05,143 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-08 16:51:05,143 INFO L745 eck$LassoCheckResult]: Stem: 404#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 398#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 399#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 400#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 401#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 390#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 391#L537-3 assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; 394#L537-6 call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 396#L549-3 assume !(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0); 387#L549-4 main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; 397#L557-3 [2024-11-08 16:51:05,143 INFO L747 eck$LassoCheckResult]: Loop: 397#L557-3 assume main_~p~0#1.base != 0 || main_~p~0#1.offset != 0; 405#L557-1 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;call ULTIMATE.dealloc(main_~p~0#1.base, main_~p~0#1.offset);main_~p~0#1.base, main_~p~0#1.offset := main_~tmp~0#1.base, main_~tmp~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset; 397#L557-3 [2024-11-08 16:51:05,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:05,143 INFO L85 PathProgramCache]: Analyzing trace with hash 643020792, now seen corresponding path program 1 times [2024-11-08 16:51:05,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:05,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218031500] [2024-11-08 16:51:05,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:05,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:05,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:51:05,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:51:05,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218031500] [2024-11-08 16:51:05,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218031500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:51:05,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:51:05,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:51:05,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165165541] [2024-11-08 16:51:05,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:51:05,224 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-08 16:51:05,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:05,224 INFO L85 PathProgramCache]: Analyzing trace with hash 3206, now seen corresponding path program 1 times [2024-11-08 16:51:05,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:05,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410577197] [2024-11-08 16:51:05,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:05,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:51:05,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:51:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:51:05,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:51:05,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:51:05,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:51:05,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:51:05,326 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 10 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) [2024-11-08 16:51:05,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:51:05,390 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-11-08 16:51:05,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 40 transitions. [2024-11-08 16:51:05,391 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-08 16:51:05,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 30 states and 35 transitions. [2024-11-08 16:51:05,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-08 16:51:05,396 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-08 16:51:05,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 35 transitions. [2024-11-08 16:51:05,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-08 16:51:05,396 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-08 16:51:05,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 35 transitions. [2024-11-08 16:51:05,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2024-11-08 16:51:05,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 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) [2024-11-08 16:51:05,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-11-08 16:51:05,402 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-08 16:51:05,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:51:05,403 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-08 16:51:05,404 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-08 16:51:05,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2024-11-08 16:51:05,405 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-08 16:51:05,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 16:51:05,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 16:51:05,406 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:51:05,407 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-08 16:51:05,407 INFO L745 eck$LassoCheckResult]: Stem: 474#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 469#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 470#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 471#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 472#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 462#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 463#L537-3 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 465#L540 assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0); 458#L540-1 call write~$Pointer$#1(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 459#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 460#L537-1 assume !main_#t~short5#1; 461#L537-3 assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; 464#L537-6 call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 466#L549-3 assume main_~p~0#1.base != 0 || main_~p~0#1.offset != 0; 456#L549-1 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 457#L550 [2024-11-08 16:51:05,408 INFO L747 eck$LassoCheckResult]: Loop: 457#L550 assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1; 476#L550-2 call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 477#L549-3 assume main_~p~0#1.base != 0 || main_~p~0#1.offset != 0; 478#L549-1 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 457#L550 [2024-11-08 16:51:05,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:05,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1118574133, now seen corresponding path program 1 times [2024-11-08 16:51:05,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:05,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690702167] [2024-11-08 16:51:05,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:05,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:05,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:51:05,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:51:05,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690702167] [2024-11-08 16:51:05,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690702167] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:51:05,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492304321] [2024-11-08 16:51:05,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:05,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:51:05,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:51:05,518 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:51:05,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-08 16:51:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:05,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 16:51:05,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:51:05,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:51:05,672 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:51:05,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:51:05,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492304321] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:51:05,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:51:05,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-08 16:51:05,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147548251] [2024-11-08 16:51:05,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:51:05,720 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-08 16:51:05,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:05,721 INFO L85 PathProgramCache]: Analyzing trace with hash 2771880, now seen corresponding path program 3 times [2024-11-08 16:51:05,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:05,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464950387] [2024-11-08 16:51:05,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:05,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:51:05,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:51:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:51:05,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:51:05,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:51:05,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:51:05,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:51:05,880 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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) [2024-11-08 16:51:06,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:51:06,035 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2024-11-08 16:51:06,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 87 transitions. [2024-11-08 16:51:06,036 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 12 [2024-11-08 16:51:06,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 73 states and 87 transitions. [2024-11-08 16:51:06,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2024-11-08 16:51:06,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2024-11-08 16:51:06,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 87 transitions. [2024-11-08 16:51:06,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-08 16:51:06,042 INFO L218 hiAutomatonCegarLoop]: Abstraction has 73 states and 87 transitions. [2024-11-08 16:51:06,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 87 transitions. [2024-11-08 16:51:06,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 39. [2024-11-08 16:51:06,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.205128205128205) internal successors, (47), 38 states have internal predecessors, (47), 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) [2024-11-08 16:51:06,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2024-11-08 16:51:06,049 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 47 transitions. [2024-11-08 16:51:06,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:51:06,050 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2024-11-08 16:51:06,050 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-08 16:51:06,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 47 transitions. [2024-11-08 16:51:06,051 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-08 16:51:06,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 16:51:06,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 16:51:06,052 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:51:06,052 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-08 16:51:06,052 INFO L745 eck$LassoCheckResult]: Stem: 676#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 669#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 670#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 671#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 672#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 673#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 665#L537-3 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 666#L540 assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0); 693#L540-1 call write~$Pointer$#1(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 674#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 660#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 661#L537-3 assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; 664#L537-6 call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 659#L549-3 assume main_~p~0#1.base != 0 || main_~p~0#1.offset != 0; 655#L549-1 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 656#L550 [2024-11-08 16:51:06,052 INFO L747 eck$LassoCheckResult]: Loop: 656#L550 assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1; 678#L550-2 call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 679#L549-3 assume main_~p~0#1.base != 0 || main_~p~0#1.offset != 0; 680#L549-1 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 656#L550 [2024-11-08 16:51:06,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:06,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1120421175, now seen corresponding path program 1 times [2024-11-08 16:51:06,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:06,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518241009] [2024-11-08 16:51:06,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:06,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:51:06,093 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:51:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:51:06,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:51:06,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:06,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2771880, now seen corresponding path program 4 times [2024-11-08 16:51:06,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:06,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861289706] [2024-11-08 16:51:06,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:06,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:51:06,126 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:51:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:51:06,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:51:06,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:06,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1846058384, now seen corresponding path program 1 times [2024-11-08 16:51:06,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:06,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381929277] [2024-11-08 16:51:06,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:06,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:06,614 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:51:06,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:51:06,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381929277] [2024-11-08 16:51:06,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381929277] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:51:06,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004299874] [2024-11-08 16:51:06,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:06,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:51:06,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:51:06,618 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:51:06,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-08 16:51:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:06,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-08 16:51:06,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:51:06,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 16:51:06,886 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 16:51:06,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-08 16:51:06,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 16:51:07,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 16:51:07,098 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 15 treesize of output 7 [2024-11-08 16:51:07,116 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:51:07,117 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:51:07,364 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_175| Int) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~a~0#1.offset| |v_ULTIMATE.start_main_~p~0#1.offset_175|) (not (= v_ArrVal_253 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_253 .cse0))))) (< (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_175|) 1) (< |v_ULTIMATE.start_main_~p~0#1.offset_175| 0))) is different from false [2024-11-08 16:51:07,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:07,465 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 72 treesize of output 76 [2024-11-08 16:51:07,499 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 58 treesize of output 54 [2024-11-08 16:51:07,536 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-08 16:51:07,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-08 16:51:07,629 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 52 treesize of output 50 [2024-11-08 16:51:07,856 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:51:07,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004299874] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:51:07,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:51:07,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 18 [2024-11-08 16:51:07,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897772921] [2024-11-08 16:51:07,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:51:08,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:51:08,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 16:51:08,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=4, NotChecked=30, Total=306 [2024-11-08 16:51:08,007 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. cyclomatic complexity: 11 Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:51:08,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:51:08,396 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2024-11-08 16:51:08,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 54 transitions. [2024-11-08 16:51:08,397 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-08 16:51:08,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 41 states and 48 transitions. [2024-11-08 16:51:08,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-11-08 16:51:08,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-11-08 16:51:08,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 48 transitions. [2024-11-08 16:51:08,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-08 16:51:08,398 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 48 transitions. [2024-11-08 16:51:08,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 48 transitions. [2024-11-08 16:51:08,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-11-08 16:51:08,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 38 states have internal predecessors, (46), 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) [2024-11-08 16:51:08,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2024-11-08 16:51:08,402 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-11-08 16:51:08,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:51:08,403 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-11-08 16:51:08,403 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-08 16:51:08,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2024-11-08 16:51:08,404 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-08 16:51:08,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 16:51:08,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 16:51:08,405 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:51:08,405 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-08 16:51:08,405 INFO L745 eck$LassoCheckResult]: Stem: 903#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 895#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 896#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 897#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 898#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 899#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 915#L537-3 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 913#L540 assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0); 912#L540-1 call write~$Pointer$#1(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 900#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 888#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 889#L537-3 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 891#L540 assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0); 884#L540-1 call write~$Pointer$#1(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 885#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 886#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 887#L537-3 assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; 890#L537-6 call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 892#L549-3 assume main_~p~0#1.base != 0 || main_~p~0#1.offset != 0; 882#L549-1 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 883#L550 [2024-11-08 16:51:08,405 INFO L747 eck$LassoCheckResult]: Loop: 883#L550 assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1; 905#L550-2 call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 906#L549-3 assume main_~p~0#1.base != 0 || main_~p~0#1.offset != 0; 908#L549-1 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 883#L550 [2024-11-08 16:51:08,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:08,406 INFO L85 PathProgramCache]: Analyzing trace with hash -2047208997, now seen corresponding path program 2 times [2024-11-08 16:51:08,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:08,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980550] [2024-11-08 16:51:08,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:08,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:51:08,443 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:51:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:51:08,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:51:08,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:08,467 INFO L85 PathProgramCache]: Analyzing trace with hash 2771880, now seen corresponding path program 5 times [2024-11-08 16:51:08,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:08,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998199422] [2024-11-08 16:51:08,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:08,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:51:08,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:51:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:51:08,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:51:08,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:51:08,478 INFO L85 PathProgramCache]: Analyzing trace with hash -189538174, now seen corresponding path program 2 times [2024-11-08 16:51:08,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:51:08,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016607853] [2024-11-08 16:51:08,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:51:08,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:51:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:51:09,319 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:51:09,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:51:09,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016607853] [2024-11-08 16:51:09,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016607853] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:51:09,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336970508] [2024-11-08 16:51:09,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 16:51:09,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:51:09,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:51:09,323 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:51:09,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-08 16:51:09,486 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 16:51:09,486 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 16:51:09,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-08 16:51:09,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:51:09,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 16:51:09,641 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 16:51:09,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-08 16:51:09,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 16:51:09,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 16:51:09,741 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 [2024-11-08 16:51:09,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 16:51:09,835 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 16:51:09,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-08 16:51:09,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 16:51:09,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 16:51:10,029 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 15 treesize of output 7 [2024-11-08 16:51:10,051 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:51:10,051 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:51:10,133 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_183| Int) (v_ArrVal_387 (Array Int Int))) (or (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_387) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_183|) 1) (< |c_ULTIMATE.start_main_~a~0#1.offset| |v_ULTIMATE.start_main_~p~0#1.offset_183|) (< |v_ULTIMATE.start_main_~p~0#1.offset_183| 0))) is different from false [2024-11-08 16:51:10,442 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-08 16:51:10,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-08 16:51:10,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:10,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 254 treesize of output 256 [2024-11-08 16:51:10,686 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 110 treesize of output 106 [2024-11-08 16:51:10,703 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 106 treesize of output 98 [2024-11-08 16:51:10,733 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-08 16:51:10,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-08 16:51:10,901 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 114 treesize of output 110 [2024-11-08 16:51:11,112 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-08 16:51:11,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336970508] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:51:11,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:51:11,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24 [2024-11-08 16:51:11,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056555774] [2024-11-08 16:51:11,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:51:11,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:51:11,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 16:51:11,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=413, Unknown=25, NotChecked=42, Total=552 [2024-11-08 16:51:11,261 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. cyclomatic complexity: 10 Second operand has 24 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 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) [2024-11-08 16:51:11,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:51:11,662 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-11-08 16:51:11,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2024-11-08 16:51:11,663 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-08 16:51:11,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. [2024-11-08 16:51:11,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-08 16:51:11,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-08 16:51:11,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-08 16:51:11,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 16:51:11,664 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 16:51:11,664 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 16:51:11,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:51:11,664 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 16:51:11,665 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-08 16:51:11,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-08 16:51:11,665 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-08 16:51:11,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-08 16:51:11,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.11 04:51:11 BoogieIcfgContainer [2024-11-08 16:51:11,674 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-08 16:51:11,675 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:51:11,675 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:51:11,675 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:51:11,676 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:50:59" (3/4) ... [2024-11-08 16:51:11,683 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 16:51:11,684 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:51:11,685 INFO L158 Benchmark]: Toolchain (without parser) took 13735.52ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 115.4MB in the beginning and 111.4MB in the end (delta: 3.9MB). Peak memory consumption was 75.4MB. Max. memory is 16.1GB. [2024-11-08 16:51:11,686 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 113.2MB. Free memory was 81.4MB in the beginning and 81.4MB in the end (delta: 28.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:51:11,686 INFO L158 Benchmark]: CACSL2BoogieTranslator took 630.81ms. Allocated memory is still 153.1MB. Free memory was 115.0MB in the beginning and 95.7MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 16:51:11,686 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.58ms. Allocated memory is still 153.1MB. Free memory was 95.7MB in the beginning and 93.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:51:11,687 INFO L158 Benchmark]: Boogie Preprocessor took 66.79ms. Allocated memory is still 153.1MB. Free memory was 93.5MB in the beginning and 91.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:51:11,687 INFO L158 Benchmark]: RCFGBuilder took 522.82ms. Allocated memory is still 153.1MB. Free memory was 91.0MB in the beginning and 117.4MB in the end (delta: -26.3MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2024-11-08 16:51:11,688 INFO L158 Benchmark]: BuchiAutomizer took 12433.64ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 116.6MB in the beginning and 111.4MB in the end (delta: 5.2MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB. [2024-11-08 16:51:11,688 INFO L158 Benchmark]: Witness Printer took 9.60ms. Allocated memory is still 222.3MB. Free memory is still 111.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:51:11,690 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 113.2MB. Free memory was 81.4MB in the beginning and 81.4MB in the end (delta: 28.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 630.81ms. Allocated memory is still 153.1MB. Free memory was 115.0MB in the beginning and 95.7MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.58ms. Allocated memory is still 153.1MB. Free memory was 95.7MB in the beginning and 93.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.79ms. Allocated memory is still 153.1MB. Free memory was 93.5MB in the beginning and 91.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 522.82ms. Allocated memory is still 153.1MB. Free memory was 91.0MB in the beginning and 117.4MB in the end (delta: -26.3MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 12433.64ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 116.6MB in the beginning and 111.4MB in the end (delta: 5.2MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB. * Witness Printer took 9.60ms. Allocated memory is still 222.3MB. Free memory is still 111.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (8 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * i) + 59) and consists of 5 locations. 8 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.3s and 10 iterations. TraceHistogramMax:3. Analysis of lassos took 10.3s. Construction of modules took 0.6s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 7. Automata minimization 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 69 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 250 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 249 mSDsluCounter, 429 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 52 IncrementalHoareTripleChecker+Unchecked, 300 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 477 IncrementalHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 129 mSDtfsCounter, 477 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN2 SILU3 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital247 mio100 ax107 hnf100 lsp86 ukn42 mio100 lsp26 div100 bol100 ite100 ukn100 eq146 hnf97 smp100 dnf151 smp85 tf100 neg100 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 61ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-08 16:51:11,728 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-08 16:51:11,919 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-08 16:51:12,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-08 16:51:12,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bccea1a-7c18-4a83-800f-7f36a86c9311/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE