./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 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/ldv-sets/test_add-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 21:21:45,979 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 21:21:46,056 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-12 21:21:46,062 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 21:21:46,062 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 21:21:46,092 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 21:21:46,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 21:21:46,093 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 21:21:46,093 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 21:21:46,094 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 21:21:46,095 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 21:21:46,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 21:21:46,095 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 21:21:46,096 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-12 21:21:46,096 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-12 21:21:46,096 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-12 21:21:46,097 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-12 21:21:46,097 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-12 21:21:46,098 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-12 21:21:46,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 21:21:46,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-12 21:21:46,102 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 21:21:46,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 21:21:46,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 21:21:46,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 21:21:46,104 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-12 21:21:46,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-12 21:21:46,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-12 21:21:46,104 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 21:21:46,105 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 21:21:46,105 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 21:21:46,106 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 21:21:46,106 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-12 21:21:46,106 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 21:21:46,107 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 21:21:46,107 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 21:21:46,107 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 21:21:46,107 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 21:21:46,108 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-12 21:21:46,108 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-12 21:21:46,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 21:21:46,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 21:21:46,394 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 21:21:46,397 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 21:21:46,397 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 21:21:46,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_add-2.i [2024-11-12 21:21:47,775 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 21:21:48,043 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 21:21:48,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_add-2.i [2024-11-12 21:21:48,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e11d4d437/c64110496fcb41a3a656437c274fc08c/FLAGb7118e33b [2024-11-12 21:21:48,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e11d4d437/c64110496fcb41a3a656437c274fc08c [2024-11-12 21:21:48,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 21:21:48,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 21:21:48,081 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 21:21:48,081 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 21:21:48,086 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 21:21:48,087 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:21:48" (1/1) ... [2024-11-12 21:21:48,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1406c711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:48, skipping insertion in model container [2024-11-12 21:21:48,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:21:48" (1/1) ... [2024-11-12 21:21:48,141 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 21:21:48,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 21:21:48,489 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 21:21:48,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 21:21:48,595 INFO L204 MainTranslator]: Completed translation [2024-11-12 21:21:48,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:48 WrapperNode [2024-11-12 21:21:48,596 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 21:21:48,597 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 21:21:48,597 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 21:21:48,597 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 21:21:48,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:48" (1/1) ... [2024-11-12 21:21:48,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:48" (1/1) ... [2024-11-12 21:21:48,642 INFO L138 Inliner]: procedures = 135, calls = 47, calls flagged for inlining = 16, calls inlined = 11, statements flattened = 120 [2024-11-12 21:21:48,642 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 21:21:48,643 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 21:21:48,647 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 21:21:48,647 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 21:21:48,657 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:48" (1/1) ... [2024-11-12 21:21:48,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:48" (1/1) ... [2024-11-12 21:21:48,664 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:48" (1/1) ... [2024-11-12 21:21:48,688 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-12 21:21:48,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:48" (1/1) ... [2024-11-12 21:21:48,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:48" (1/1) ... [2024-11-12 21:21:48,696 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:48" (1/1) ... [2024-11-12 21:21:48,699 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:48" (1/1) ... [2024-11-12 21:21:48,701 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:48" (1/1) ... [2024-11-12 21:21:48,702 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:48" (1/1) ... [2024-11-12 21:21:48,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 21:21:48,706 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 21:21:48,706 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 21:21:48,706 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 21:21:48,707 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:48" (1/1) ... [2024-11-12 21:21:48,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:48,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:48,740 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:48,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-12 21:21:48,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 21:21:48,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 21:21:48,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 21:21:48,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 21:21:48,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 21:21:48,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 21:21:48,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 21:21:48,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 21:21:48,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 21:21:48,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 21:21:48,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-12 21:21:48,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-12 21:21:48,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 21:21:48,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 21:21:48,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 21:21:48,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 21:21:48,942 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 21:21:48,944 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 21:21:49,153 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-11-12 21:21:49,153 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 21:21:49,168 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 21:21:49,168 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 21:21:49,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:21:49 BoogieIcfgContainer [2024-11-12 21:21:49,168 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 21:21:49,169 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-12 21:21:49,169 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-12 21:21:49,173 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-12 21:21:49,174 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:21:49,174 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.11 09:21:48" (1/3) ... [2024-11-12 21:21:49,175 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@647d9eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 09:21:49, skipping insertion in model container [2024-11-12 21:21:49,176 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:21:49,176 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:48" (2/3) ... [2024-11-12 21:21:49,177 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@647d9eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 09:21:49, skipping insertion in model container [2024-11-12 21:21:49,178 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:21:49,179 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:21:49" (3/3) ... [2024-11-12 21:21:49,181 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_add-2.i [2024-11-12 21:21:49,228 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2024-11-12 21:21:49,228 INFO L302 stractBuchiCegarLoop]: Hoare is None [2024-11-12 21:21:49,228 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-12 21:21:49,228 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-12 21:21:49,228 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-12 21:21:49,228 INFO L306 stractBuchiCegarLoop]: Difference is false [2024-11-12 21:21:49,228 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-12 21:21:49,229 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-12 21:21:49,232 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-12 21:21:49,246 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-12 21:21:49,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:21:49,246 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:21:49,251 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:21:49,251 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-12 21:21:49,251 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-12 21:21:49,251 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-12 21:21:49,253 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-12 21:21:49,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:21:49,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:21:49,254 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:21:49,254 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-12 21:21:49,259 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-12 21:21:49,259 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-12 21:21:49,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:49,264 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-12 21:21:49,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:49,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393359968] [2024-11-12 21:21:49,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:49,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:49,369 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:49,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:21:49,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:49,408 INFO L85 PathProgramCache]: Analyzing trace with hash 39883, now seen corresponding path program 1 times [2024-11-12 21:21:49,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:49,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027943117] [2024-11-12 21:21:49,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:49,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:49,419 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:49,432 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:21:49,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:49,434 INFO L85 PathProgramCache]: Analyzing trace with hash 28698825, now seen corresponding path program 1 times [2024-11-12 21:21:49,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:49,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665362962] [2024-11-12 21:21:49,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:49,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:21:49,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:21:49,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665362962] [2024-11-12 21:21:49,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665362962] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:21:49,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012213970] [2024-11-12 21:21:49,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:49,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:21:49,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:49,741 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:21:49,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 21:21:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:21:49,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-12 21:21:49,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:21:50,008 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-12 21:21:50,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:21:50,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012213970] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:21:50,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:21:50,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-12 21:21:50,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666059751] [2024-11-12 21:21:50,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:21:50,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:21:50,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 21:21:50,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 21:21:50,223 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.4285714285714286) internal successors, (10), 6 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-12 21:21:50,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:21:50,351 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2024-11-12 21:21:50,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 34 transitions. [2024-11-12 21:21:50,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-12 21:21:50,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 15 states and 15 transitions. [2024-11-12 21:21:50,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-12 21:21:50,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-11-12 21:21:50,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 15 transitions. [2024-11-12 21:21:50,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:21:50,361 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-12 21:21:50,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 15 transitions. [2024-11-12 21:21:50,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-12 21:21:50,384 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-12 21:21:50,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-12 21:21:50,385 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-12 21:21:50,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 21:21:50,391 INFO L426 stractBuchiCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-12 21:21:50,393 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-12 21:21:50,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 15 transitions. [2024-11-12 21:21:50,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-12 21:21:50,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:21:50,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:21:50,397 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:21:50,397 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-12 21:21:50,398 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-12 21:21:50,399 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-12 21:21:50,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:50,401 INFO L85 PathProgramCache]: Analyzing trace with hash -812001189, now seen corresponding path program 1 times [2024-11-12 21:21:50,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:50,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892295120] [2024-11-12 21:21:50,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:50,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:50,534 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:50,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:21:50,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:50,589 INFO L85 PathProgramCache]: Analyzing trace with hash 80596, now seen corresponding path program 1 times [2024-11-12 21:21:50,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:50,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582401671] [2024-11-12 21:21:50,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:50,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:50,599 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:50,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:21:50,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:50,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1071559622, now seen corresponding path program 1 times [2024-11-12 21:21:50,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:50,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008086044] [2024-11-12 21:21:50,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:50,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:21:51,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:21:51,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008086044] [2024-11-12 21:21:51,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008086044] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:21:51,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091698001] [2024-11-12 21:21:51,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:51,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:21:51,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:51,979 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:21:51,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 21:21:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:21:52,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-12 21:21:52,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:21:52,285 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 21:21:52,286 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-12 21:21:52,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 21:21:52,531 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-12 21:21:52,548 INFO L349 Elim1Store]: treesize reduction 27, result has 32.5 percent of original size [2024-11-12 21:21:52,548 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-12 21:21:52,557 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-12 21:21:52,567 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-12 21:21:52,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 21:21:52,593 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-12 21:21:52,595 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-12 21:21:52,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 21:21:52,633 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-12 21:21:52,744 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-12 21:21:52,745 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-12 21:21:52,750 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-12 21:21:52,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 21:21:52,797 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-12 21:21:52,806 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-12 21:21:52,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:21:53,021 INFO L349 Elim1Store]: treesize reduction 307, result has 51.0 percent of original size [2024-11-12 21:21:53,021 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-12 21:21:53,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 21:21:53,086 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-12 21:21:53,567 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-12 21:21:54,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 21:21:54,276 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-12 21:21:54,841 INFO L349 Elim1Store]: treesize reduction 66, result has 70.1 percent of original size [2024-11-12 21:21:54,843 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-12 21:21:55,725 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-12 21:21:56,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 21:21:56,398 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-12 21:22:03,013 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-12 21:22:03,077 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-12 21:22:03,118 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-12 21:22:03,178 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-12 21:22:03,248 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-12 21:22:03,289 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-12 21:22:03,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 9 treesize of output 3 [2024-11-12 21:22:03,374 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-12 21:22:03,436 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-12 21:22:03,512 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-12 21:22:03,635 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-12 21:22:03,707 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-12 21:22:28,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 21:22:28,703 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