./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-sets/test_add-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f47113-ba2f-4fc2-95a1-3b6748c2a36b/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f47113-ba2f-4fc2-95a1-3b6748c2a36b/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f47113-ba2f-4fc2-95a1-3b6748c2a36b/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f47113-ba2f-4fc2-95a1-3b6748c2a36b/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-sets/test_add-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f47113-ba2f-4fc2-95a1-3b6748c2a36b/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f47113-ba2f-4fc2-95a1-3b6748c2a36b/bin/uautomizer-verify-LYvppIcaGC --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 b0bf6ee66b233cfe70507a3d8d55aa219725b8ce14e12bc2fdcf83f18b236eff --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 01:43:21,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 01:43:21,363 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f47113-ba2f-4fc2-95a1-3b6748c2a36b/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-24 01:43:21,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 01:43:21,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 01:43:21,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 01:43:21,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 01:43:21,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 01:43:21,420 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 01:43:21,421 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 01:43:21,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 01:43:21,421 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 01:43:21,421 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 01:43:21,422 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-24 01:43:21,422 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-24 01:43:21,422 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-24 01:43:21,422 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-24 01:43:21,422 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-24 01:43:21,422 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-24 01:43:21,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 01:43:21,423 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-24 01:43:21,423 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 01:43:21,423 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 01:43:21,423 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 01:43:21,423 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 01:43:21,423 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-24 01:43:21,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-24 01:43:21,424 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-24 01:43:21,424 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-24 01:43:21,424 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 01:43:21,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 01:43:21,424 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-24 01:43:21,424 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 01:43:21,424 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 01:43:21,425 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 01:43:21,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:43:21,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 01:43:21,425 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL_NO_AM [2024-11-24 01:43:21,425 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-24 01:43:21,426 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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_20f47113-ba2f-4fc2-95a1-3b6748c2a36b/bin/uautomizer-verify-LYvppIcaGC 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 -> b0bf6ee66b233cfe70507a3d8d55aa219725b8ce14e12bc2fdcf83f18b236eff [2024-11-24 01:43:21,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 01:43:21,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 01:43:21,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 01:43:21,806 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 01:43:21,806 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 01:43:21,807 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f47113-ba2f-4fc2-95a1-3b6748c2a36b/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/ldv-sets/test_add-2.i [2024-11-24 01:43:24,949 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f47113-ba2f-4fc2-95a1-3b6748c2a36b/bin/uautomizer-verify-LYvppIcaGC/data/5a4c8120d/0d76909bccf84a8da92179318878e9ed/FLAG63efa3a25 [2024-11-24 01:43:25,318 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 01:43:25,322 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f47113-ba2f-4fc2-95a1-3b6748c2a36b/sv-benchmarks/c/ldv-sets/test_add-2.i [2024-11-24 01:43:25,344 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f47113-ba2f-4fc2-95a1-3b6748c2a36b/bin/uautomizer-verify-LYvppIcaGC/data/5a4c8120d/0d76909bccf84a8da92179318878e9ed/FLAG63efa3a25 [2024-11-24 01:43:25,372 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f47113-ba2f-4fc2-95a1-3b6748c2a36b/bin/uautomizer-verify-LYvppIcaGC/data/5a4c8120d/0d76909bccf84a8da92179318878e9ed [2024-11-24 01:43:25,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 01:43:25,378 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 01:43:25,380 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 01:43:25,380 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 01:43:25,386 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 01:43:25,387 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:43:25" (1/1) ... [2024-11-24 01:43:25,390 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60417000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:43:25, skipping insertion in model container [2024-11-24 01:43:25,390 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:43:25" (1/1) ... [2024-11-24 01:43:25,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 01:43:25,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:43:25,856 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 01:43:25,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:43:25,997 INFO L204 MainTranslator]: Completed translation [2024-11-24 01:43:25,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:43:25 WrapperNode [2024-11-24 01:43:25,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 01:43:26,000 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 01:43:26,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 01:43:26,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 01:43:26,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:43:25" (1/1) ... [2024-11-24 01:43:26,021 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:43:25" (1/1) ... [2024-11-24 01:43:26,045 INFO L138 Inliner]: procedures = 135, calls = 47, calls flagged for inlining = 16, calls inlined = 11, statements flattened = 118 [2024-11-24 01:43:26,045 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 01:43:26,046 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 01:43:26,046 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 01:43:26,046 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 01:43:26,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:43:25" (1/1) ... [2024-11-24 01:43:26,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:43:25" (1/1) ... [2024-11-24 01:43:26,061 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:43:25" (1/1) ... [2024-11-24 01:43:26,084 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 5 writes are split as follows [0, 5]. [2024-11-24 01:43:26,085 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:43:25" (1/1) ... [2024-11-24 01:43:26,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:43:25" (1/1) ... [2024-11-24 01:43:26,095 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:43:25" (1/1) ... [2024-11-24 01:43:26,096 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:43:25" (1/1) ... [2024-11-24 01:43:26,099 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:43:25" (1/1) ... [2024-11-24 01:43:26,101 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:43:25" (1/1) ... [2024-11-24 01:43:26,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:43:25" (1/1) ... [2024-11-24 01:43:26,105 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 01:43:26,106 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 01:43:26,107 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 01:43:26,107 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 01:43:26,108 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:43:25" (1/1) ... [2024-11-24 01:43:26,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-24 01:43:26,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f47113-ba2f-4fc2-95a1-3b6748c2a36b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:43:26,149 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f47113-ba2f-4fc2-95a1-3b6748c2a36b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-24 01:43:26,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f47113-ba2f-4fc2-95a1-3b6748c2a36b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-24 01:43:26,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-24 01:43:26,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-24 01:43:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-24 01:43:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-24 01:43:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-24 01:43:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 01:43:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-24 01:43:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-24 01:43:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-24 01:43:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-24 01:43:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-24 01:43:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-24 01:43:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-24 01:43:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-24 01:43:26,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 01:43:26,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 01:43:26,335 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 01:43:26,340 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 01:43:26,693 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-11-24 01:43:26,694 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 01:43:26,715 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 01:43:26,715 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-24 01:43:26,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:43:26 BoogieIcfgContainer [2024-11-24 01:43:26,716 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 01:43:26,718 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-24 01:43:26,718 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-24 01:43:26,725 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-24 01:43:26,726 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-24 01:43:26,726 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 24.11 01:43:25" (1/3) ... [2024-11-24 01:43:26,728 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@211b3558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 24.11 01:43:26, skipping insertion in model container [2024-11-24 01:43:26,728 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-24 01:43:26,728 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:43:25" (2/3) ... [2024-11-24 01:43:26,729 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@211b3558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 24.11 01:43:26, skipping insertion in model container [2024-11-24 01:43:26,729 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-24 01:43:26,729 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:43:26" (3/3) ... [2024-11-24 01:43:26,732 INFO L363 chiAutomizerObserver]: Analyzing ICFG test_add-2.i [2024-11-24 01:43:26,800 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-24 01:43:26,801 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-24 01:43:26,801 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-24 01:43:26,801 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-24 01:43:26,801 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-24 01:43:26,801 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-24 01:43:26,801 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-24 01:43:26,801 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-24 01:43:26,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:43:26,832 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-24 01:43:26,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-24 01:43:26,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-24 01:43:26,840 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-24 01:43:26,840 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-24 01:43:26,840 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-24 01:43:26,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:43:26,843 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-24 01:43:26,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-24 01:43:26,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-24 01:43:26,844 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-24 01:43:26,844 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-24 01:43:26,856 INFO L747 eck$LassoCheckResult]: Stem: "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(12, 2);call #Ultimate.allocInit(8, 3);~#s1~0.base, ~#s1~0.offset := 3, 0;call write~init~$Pointer$#1(~#s1~0.base, ~#s1~0.offset, ~#s1~0.base, ~#s1~0.offset, 4);call write~init~$Pointer$#1(~#s1~0.base, ~#s1~0.offset, ~#s1~0.base, 4 + ~#s1~0.offset, 4);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_foo } true;havoc foo_#t~nondet32#1, foo_#t~ret33#1, foo_~j~0#1;havoc foo_#t~nondet32#1;foo_~j~0#1 := foo_#t~nondet32#1;havoc foo_#t~nondet32#1;assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~new#1, ldv_set_add_#in~s#1.base, ldv_set_add_#in~s#1.offset := foo_~j~0#1, ~#s1~0.base, ~#s1~0.offset;havoc ldv_set_add_#t~ret17#1, ldv_set_add_#t~ret18#1.base, ldv_set_add_#t~ret18#1.offset, ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset, ldv_set_add_~new#1, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;ldv_set_add_~new#1 := ldv_set_add_#in~new#1;ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset := ldv_set_add_#in~s#1.base, ldv_set_add_#in~s#1.offset;assume { :begin_inline_ldv_is_in_set } true;ldv_is_in_set_#in~e#1, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset := ldv_set_add_~new#1, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;havoc ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset, ldv_is_in_set_#t~ret27#1.base, ldv_is_in_set_#t~ret27#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem28#1, ldv_is_in_set_#t~mem29#1.base, ldv_is_in_set_#t~mem29#1.offset, ldv_is_in_set_#t~ret30#1.base, ldv_is_in_set_#t~ret30#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;ldv_is_in_set_~e#1 := ldv_is_in_set_#in~e#1;ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset := ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;havoc ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;call ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset := read~$Pointer$#1(ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, 4);ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset := ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset;havoc ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset;ldv_is_in_set_#t~ret27#1.base, ldv_is_in_set_#t~ret27#1.offset := ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset - 4;havoc ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_#t~ret27#1.base, ldv_is_in_set_#t~ret27#1.offset;havoc ldv_is_in_set_#t~ret27#1.base, ldv_is_in_set_#t~ret27#1.offset;" [2024-11-24 01:43:26,856 INFO L749 eck$LassoCheckResult]: Loop: "assume ldv_is_in_set_~m~1#1.base != ldv_is_in_set_~s#1.base || 4 + ldv_is_in_set_~m~1#1.offset != ldv_is_in_set_~s#1.offset;" "call ldv_is_in_set_#t~mem28#1 := read~int#1(ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset, 4);" "assume !(ldv_is_in_set_#t~mem28#1 == ldv_is_in_set_~e#1);havoc ldv_is_in_set_#t~mem28#1;call ldv_is_in_set_#t~mem29#1.base, ldv_is_in_set_#t~mem29#1.offset := read~$Pointer$#1(ldv_is_in_set_~m~1#1.base, 4 + ldv_is_in_set_~m~1#1.offset, 4);ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset := ldv_is_in_set_#t~mem29#1.base, ldv_is_in_set_#t~mem29#1.offset;havoc ldv_is_in_set_#t~mem29#1.base, ldv_is_in_set_#t~mem29#1.offset;ldv_is_in_set_#t~ret30#1.base, ldv_is_in_set_#t~ret30#1.offset := ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset - 4;havoc ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_#t~ret30#1.base, ldv_is_in_set_#t~ret30#1.offset;havoc ldv_is_in_set_#t~ret30#1.base, ldv_is_in_set_#t~ret30#1.offset;" [2024-11-24 01:43:26,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:43:26,862 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-24 01:43:26,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-24 01:43:26,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976613811] [2024-11-24 01:43:26,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:43:26,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:43:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 01:43:27,029 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 01:43:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 01:43:27,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-24 01:43:27,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:43:27,083 INFO L85 PathProgramCache]: Analyzing trace with hash 37868, now seen corresponding path program 1 times [2024-11-24 01:43:27,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-24 01:43:27,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335218674] [2024-11-24 01:43:27,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:43:27,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:43:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 01:43:27,110 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 01:43:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 01:43:27,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-24 01:43:27,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:43:27,155 INFO L85 PathProgramCache]: Analyzing trace with hash 28696810, now seen corresponding path program 1 times [2024-11-24 01:43:27,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-24 01:43:27,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554567171] [2024-11-24 01:43:27,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:43:27,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:43:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:43:27,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-24 01:43:27,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554567171] [2024-11-24 01:43:27,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554567171] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:43:27,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719090145] [2024-11-24 01:43:27,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:43:27,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:43:27,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f47113-ba2f-4fc2-95a1-3b6748c2a36b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:43:27,509 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f47113-ba2f-4fc2-95a1-3b6748c2a36b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:43:27,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f47113-ba2f-4fc2-95a1-3b6748c2a36b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-24 01:43:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:43:27,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-24 01:43:27,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:43:27,782 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 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-24 01:43:27,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:43:27,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719090145] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:43:27,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 01:43:27,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-24 01:43:27,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661422962] [2024-11-24 01:43:27,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 01:43:28,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-24 01:43:28,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 01:43:28,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:43:28,041 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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-24 01:43:28,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:43:28,294 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2024-11-24 01:43:28,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 36 transitions. [2024-11-24 01:43:28,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-24 01:43:28,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 15 states and 15 transitions. [2024-11-24 01:43:28,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-24 01:43:28,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-11-24 01:43:28,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 15 transitions. [2024-11-24 01:43:28,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-24 01:43:28,313 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-24 01:43:28,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 15 transitions. [2024-11-24 01:43:28,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-24 01:43:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.0) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:43:28,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-24 01:43:28,342 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-24 01:43:28,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:43:28,348 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-24 01:43:28,349 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-24 01:43:28,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 15 transitions. [2024-11-24 01:43:28,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-24 01:43:28,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-24 01:43:28,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-24 01:43:28,351 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:43:28,351 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-24 01:43:28,352 INFO L747 eck$LassoCheckResult]: Stem: "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(12, 2);call #Ultimate.allocInit(8, 3);~#s1~0.base, ~#s1~0.offset := 3, 0;call write~init~$Pointer$#1(~#s1~0.base, ~#s1~0.offset, ~#s1~0.base, ~#s1~0.offset, 4);call write~init~$Pointer$#1(~#s1~0.base, ~#s1~0.offset, ~#s1~0.base, 4 + ~#s1~0.offset, 4);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_foo } true;havoc foo_#t~nondet32#1, foo_#t~ret33#1, foo_~j~0#1;havoc foo_#t~nondet32#1;foo_~j~0#1 := foo_#t~nondet32#1;havoc foo_#t~nondet32#1;assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~new#1, ldv_set_add_#in~s#1.base, ldv_set_add_#in~s#1.offset := foo_~j~0#1, ~#s1~0.base, ~#s1~0.offset;havoc ldv_set_add_#t~ret17#1, ldv_set_add_#t~ret18#1.base, ldv_set_add_#t~ret18#1.offset, ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset, ldv_set_add_~new#1, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;ldv_set_add_~new#1 := ldv_set_add_#in~new#1;ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset := ldv_set_add_#in~s#1.base, ldv_set_add_#in~s#1.offset;assume { :begin_inline_ldv_is_in_set } true;ldv_is_in_set_#in~e#1, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset := ldv_set_add_~new#1, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;havoc ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset, ldv_is_in_set_#t~ret27#1.base, ldv_is_in_set_#t~ret27#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem28#1, ldv_is_in_set_#t~mem29#1.base, ldv_is_in_set_#t~mem29#1.offset, ldv_is_in_set_#t~ret30#1.base, ldv_is_in_set_#t~ret30#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;ldv_is_in_set_~e#1 := ldv_is_in_set_#in~e#1;ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset := ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;havoc ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;call ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset := read~$Pointer$#1(ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, 4);ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset := ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset;havoc ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset;ldv_is_in_set_#t~ret27#1.base, ldv_is_in_set_#t~ret27#1.offset := ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset - 4;havoc ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_#t~ret27#1.base, ldv_is_in_set_#t~ret27#1.offset;havoc ldv_is_in_set_#t~ret27#1.base, ldv_is_in_set_#t~ret27#1.offset;" "assume !(ldv_is_in_set_~m~1#1.base != ldv_is_in_set_~s#1.base || 4 + ldv_is_in_set_~m~1#1.offset != ldv_is_in_set_~s#1.offset);" "ldv_is_in_set_#res#1 := 0;" "ldv_set_add_#t~ret17#1 := ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset, ldv_is_in_set_#t~ret27#1.base, ldv_is_in_set_#t~ret27#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem28#1, ldv_is_in_set_#t~mem29#1.base, ldv_is_in_set_#t~mem29#1.offset, ldv_is_in_set_#t~ret30#1.base, ldv_is_in_set_#t~ret30#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;havoc ldv_is_in_set_#in~e#1, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;assume { :end_inline_ldv_is_in_set } true;" "assume 0 == ldv_set_add_#t~ret17#1;havoc ldv_set_add_#t~ret17#1;havoc ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset;assume { :begin_inline_ldv_successful_malloc } true;ldv_successful_malloc_#in~size#1 := 12;havoc ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;havoc ldv_successful_malloc_#t~malloc5#1.base, ldv_successful_malloc_#t~malloc5#1.offset, ldv_successful_malloc_~size#1, ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset;ldv_successful_malloc_~size#1 := ldv_successful_malloc_#in~size#1;call ldv_successful_malloc_#t~malloc5#1.base, ldv_successful_malloc_#t~malloc5#1.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size#1 % 4294967296);ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset := ldv_successful_malloc_#t~malloc5#1.base, ldv_successful_malloc_#t~malloc5#1.offset;havoc ldv_successful_malloc_#t~malloc5#1.base, ldv_successful_malloc_#t~malloc5#1.offset;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ldv_successful_malloc_~ptr~0#1.base != 0 || ldv_successful_malloc_~ptr~0#1.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset := ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset;" "ldv_set_add_#t~ret18#1.base, ldv_set_add_#t~ret18#1.offset := ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;havoc ldv_successful_malloc_#t~malloc5#1.base, ldv_successful_malloc_#t~malloc5#1.offset, ldv_successful_malloc_~size#1, ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset;havoc ldv_successful_malloc_#in~size#1;assume { :end_inline_ldv_successful_malloc } true;ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset := ldv_set_add_#t~ret18#1.base, ldv_set_add_#t~ret18#1.offset;havoc ldv_set_add_#t~ret18#1.base, ldv_set_add_#t~ret18#1.offset;call write~int#1(ldv_set_add_~new#1, ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset, 4);assume { :begin_inline_ldv_list_add } true;ldv_list_add_#in~new#1.base, ldv_list_add_#in~new#1.offset, ldv_list_add_#in~head#1.base, ldv_list_add_#in~head#1.offset := ldv_set_add_~le~0#1.base, 4 + ldv_set_add_~le~0#1.offset, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;havoc ldv_list_add_#t~mem6#1.base, ldv_list_add_#t~mem6#1.offset, ldv_list_add_~new#1.base, ldv_list_add_~new#1.offset, ldv_list_add_~head#1.base, ldv_list_add_~head#1.offset;ldv_list_add_~new#1.base, ldv_list_add_~new#1.offset := ldv_list_add_#in~new#1.base, ldv_list_add_#in~new#1.offset;ldv_list_add_~head#1.base, ldv_list_add_~head#1.offset := ldv_list_add_#in~head#1.base, ldv_list_add_#in~head#1.offset;call ldv_list_add_#t~mem6#1.base, ldv_list_add_#t~mem6#1.offset := read~$Pointer$#1(ldv_list_add_~head#1.base, ldv_list_add_~head#1.offset, 4);assume { :begin_inline___ldv_list_add } true;__ldv_list_add_#in~new#1.base, __ldv_list_add_#in~new#1.offset, __ldv_list_add_#in~prev#1.base, __ldv_list_add_#in~prev#1.offset, __ldv_list_add_#in~next#1.base, __ldv_list_add_#in~next#1.offset := ldv_list_add_~new#1.base, ldv_list_add_~new#1.offset, ldv_list_add_~head#1.base, ldv_list_add_~head#1.offset, ldv_list_add_#t~mem6#1.base, ldv_list_add_#t~mem6#1.offset;havoc __ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset, __ldv_list_add_~prev#1.base, __ldv_list_add_~prev#1.offset, __ldv_list_add_~next#1.base, __ldv_list_add_~next#1.offset;__ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset := __ldv_list_add_#in~new#1.base, __ldv_list_add_#in~new#1.offset;__ldv_list_add_~prev#1.base, __ldv_list_add_~prev#1.offset := __ldv_list_add_#in~prev#1.base, __ldv_list_add_#in~prev#1.offset;__ldv_list_add_~next#1.base, __ldv_list_add_~next#1.offset := __ldv_list_add_#in~next#1.base, __ldv_list_add_#in~next#1.offset;call write~$Pointer$#1(__ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset, __ldv_list_add_~next#1.base, 4 + __ldv_list_add_~next#1.offset, 4);call write~$Pointer$#1(__ldv_list_add_~next#1.base, __ldv_list_add_~next#1.offset, __ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset, 4);call write~$Pointer$#1(__ldv_list_add_~prev#1.base, __ldv_list_add_~prev#1.offset, __ldv_list_add_~new#1.base, 4 + __ldv_list_add_~new#1.offset, 4);call write~$Pointer$#1(__ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset, __ldv_list_add_~prev#1.base, __ldv_list_add_~prev#1.offset, 4);" "havoc __ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset, __ldv_list_add_~prev#1.base, __ldv_list_add_~prev#1.offset, __ldv_list_add_~next#1.base, __ldv_list_add_~next#1.offset;havoc __ldv_list_add_#in~new#1.base, __ldv_list_add_#in~new#1.offset, __ldv_list_add_#in~prev#1.base, __ldv_list_add_#in~prev#1.offset, __ldv_list_add_#in~next#1.base, __ldv_list_add_#in~next#1.offset;assume { :end_inline___ldv_list_add } true;havoc ldv_list_add_#t~mem6#1.base, ldv_list_add_#t~mem6#1.offset;" "havoc ldv_list_add_#t~mem6#1.base, ldv_list_add_#t~mem6#1.offset, ldv_list_add_~new#1.base, ldv_list_add_~new#1.offset, ldv_list_add_~head#1.base, ldv_list_add_~head#1.offset;havoc ldv_list_add_#in~new#1.base, ldv_list_add_#in~new#1.offset, ldv_list_add_#in~head#1.base, ldv_list_add_#in~head#1.offset;assume { :end_inline_ldv_list_add } true;havoc ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset;" "havoc ldv_set_add_#t~ret17#1, ldv_set_add_#t~ret18#1.base, ldv_set_add_#t~ret18#1.offset, ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset, ldv_set_add_~new#1, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;havoc ldv_set_add_#in~new#1, ldv_set_add_#in~s#1.base, ldv_set_add_#in~s#1.offset;assume { :end_inline_ldv_set_add } true;assume { :begin_inline_ldv_is_in_set } true;ldv_is_in_set_#in~e#1, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset := foo_~j~0#1, ~#s1~0.base, ~#s1~0.offset;havoc ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset, ldv_is_in_set_#t~ret27#1.base, ldv_is_in_set_#t~ret27#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem28#1, ldv_is_in_set_#t~mem29#1.base, ldv_is_in_set_#t~mem29#1.offset, ldv_is_in_set_#t~ret30#1.base, ldv_is_in_set_#t~ret30#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;ldv_is_in_set_~e#1 := ldv_is_in_set_#in~e#1;ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset := ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;havoc ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;call ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset := read~$Pointer$#1(ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, 4);ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset := ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset;havoc ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset;ldv_is_in_set_#t~ret27#1.base, ldv_is_in_set_#t~ret27#1.offset := ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset - 4;havoc ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_#t~ret27#1.base, ldv_is_in_set_#t~ret27#1.offset;havoc ldv_is_in_set_#t~ret27#1.base, ldv_is_in_set_#t~ret27#1.offset;" [2024-11-24 01:43:28,352 INFO L749 eck$LassoCheckResult]: Loop: "assume ldv_is_in_set_~m~1#1.base != ldv_is_in_set_~s#1.base || 4 + ldv_is_in_set_~m~1#1.offset != ldv_is_in_set_~s#1.offset;" "call ldv_is_in_set_#t~mem28#1 := read~int#1(ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset, 4);" "assume !(ldv_is_in_set_#t~mem28#1 == ldv_is_in_set_~e#1);havoc ldv_is_in_set_#t~mem28#1;call ldv_is_in_set_#t~mem29#1.base, ldv_is_in_set_#t~mem29#1.offset := read~$Pointer$#1(ldv_is_in_set_~m~1#1.base, 4 + ldv_is_in_set_~m~1#1.offset, 4);ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset := ldv_is_in_set_#t~mem29#1.base, ldv_is_in_set_#t~mem29#1.offset;havoc ldv_is_in_set_#t~mem29#1.base, ldv_is_in_set_#t~mem29#1.offset;ldv_is_in_set_#t~ret30#1.base, ldv_is_in_set_#t~ret30#1.offset := ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset - 4;havoc ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_#t~ret30#1.base, ldv_is_in_set_#t~ret30#1.offset;havoc ldv_is_in_set_#t~ret30#1.base, ldv_is_in_set_#t~ret30#1.offset;" [2024-11-24 01:43:28,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:43:28,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1205028199, now seen corresponding path program 1 times [2024-11-24 01:43:28,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-24 01:43:28,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432013549] [2024-11-24 01:43:28,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:43:28,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:43:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 01:43:28,542 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 01:43:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 01:43:28,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-24 01:43:28,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:43:28,620 INFO L85 PathProgramCache]: Analyzing trace with hash 78581, now seen corresponding path program 1 times [2024-11-24 01:43:28,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-24 01:43:28,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848476393] [2024-11-24 01:43:28,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:43:28,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:43:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 01:43:28,630 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 01:43:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 01:43:28,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-24 01:43:28,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:43:28,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1658367651, now seen corresponding path program 1 times [2024-11-24 01:43:28,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-24 01:43:28,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703693642] [2024-11-24 01:43:28,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:43:28,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:43:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:43:30,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-24 01:43:30,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703693642] [2024-11-24 01:43:30,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703693642] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:43:30,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046420570] [2024-11-24 01:43:30,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:43:30,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:43:30,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f47113-ba2f-4fc2-95a1-3b6748c2a36b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:43:30,766 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f47113-ba2f-4fc2-95a1-3b6748c2a36b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:43:30,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f47113-ba2f-4fc2-95a1-3b6748c2a36b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-24 01:43:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:43:30,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-24 01:43:31,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:43:31,228 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 01:43:31,229 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-24 01:43:31,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 01:43:31,645 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 29 treesize of output 19 [2024-11-24 01:43:31,675 INFO L349 Elim1Store]: treesize reduction 27, result has 32.5 percent of original size [2024-11-24 01:43:31,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 27 treesize of output 17 [2024-11-24 01:43:31,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 100 [2024-11-24 01:43:31,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2024-11-24 01:43:31,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 01:43:31,768 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 26 treesize of output 12 [2024-11-24 01:43:31,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-24 01:43:31,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 01:43:31,865 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-24 01:43:32,062 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-24 01:43:32,063 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 96 treesize of output 58 [2024-11-24 01:43:32,073 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 68 treesize of output 44 [2024-11-24 01:43:32,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 01:43:32,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2024-11-24 01:43:32,192 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 11 treesize of output 7 [2024-11-24 01:43:32,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:43:32,539 INFO L349 Elim1Store]: treesize reduction 307, result has 51.0 percent of original size [2024-11-24 01:43:32,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 4290 treesize of output 4300 [2024-11-24 01:43:32,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:43:32,640 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 32690 treesize of output 32338 [2024-11-24 01:43:33,422 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 13682 treesize of output 13394 [2024-11-24 01:43:34,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:43:34,474 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 17402 treesize of output 13112 [2024-11-24 01:43:35,357 INFO L349 Elim1Store]: treesize reduction 66, result has 70.1 percent of original size [2024-11-24 01:43:35,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 16569 treesize of output 15939 [2024-11-24 01:43:36,503 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 14820 treesize of output 14554 [2024-11-24 01:43:37,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:43:37,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 12729 treesize of output 12101 [2024-11-24 01:43:46,925 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 7 treesize of output 3 [2024-11-24 01:43:47,032 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 9 treesize of output 3 [2024-11-24 01:43:47,090 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 7 treesize of output 3 [2024-11-24 01:43:47,185 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 9 treesize of output 3 [2024-11-24 01:43:47,274 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 7 treesize of output 3 [2024-11-24 01:43:47,315 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 7 treesize of output 3 [2024-11-24 01:43:47,341 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 9 treesize of output 3 [2024-11-24 01:43:47,418 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 7 treesize of output 3 [2024-11-24 01:43:47,506 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 7 treesize of output 3 [2024-11-24 01:43:47,623 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 14 treesize of output 3 [2024-11-24 01:43:47,787 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 9 treesize of output 3 [2024-11-24 01:43:47,885 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 7 treesize of output 3 [2024-11-24 01:44:22,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:44:22,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 10157 treesize of output 10089 [2024-11-24 01:50:35,212 WARN L286 SmtUtils]: Spent 10.86s on a formula simplification. DAG size of input: 4342 DAG size of output: 4428 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:55:25,285 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification. DAG size of input: 4632 DAG size of output: 4632 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)