./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-simple/sll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/list-simple/sll2c_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:13:51,519 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:13:51,559 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-30 10:13:51,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:13:51,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:13:51,585 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:13:51,586 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:13:51,586 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:13:51,587 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:13:51,587 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:13:51,587 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:13:51,587 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:13:51,588 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:13:51,588 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:13:51,588 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:13:51,588 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:13:51,588 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:13:51,588 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:13:51,588 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:13:51,589 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:13:51,589 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:13:51,589 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:13:51,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:13:51,589 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:13:51,589 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:13:51,589 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:13:51,589 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:13:51,589 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:13:51,589 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:13:51,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:13:51,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:13:51,589 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:13:51,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:13:51,590 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:13:51,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:13:51,590 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:13:51,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:13:51,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:13:51,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:13:51,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:13:51,591 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:13:51,591 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:13:51,591 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:13:51,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:13:51,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:13:51,591 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:13:51,591 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:13:51,591 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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(G ! call(reach_error())) ) 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 -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2025-04-30 10:13:51,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:13:51,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:13:51,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:13:51,807 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:13:51,808 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:13:51,809 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_insert_unequal.i [2025-04-30 10:13:53,059 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1acf0a9c0/81e3e79cd3e44e4fad75f1c738e015fe/FLAGc156b1383 [2025-04-30 10:13:53,310 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:13:53,311 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_insert_unequal.i [2025-04-30 10:13:53,326 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1acf0a9c0/81e3e79cd3e44e4fad75f1c738e015fe/FLAGc156b1383 [2025-04-30 10:13:54,110 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1acf0a9c0/81e3e79cd3e44e4fad75f1c738e015fe [2025-04-30 10:13:54,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:13:54,113 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:13:54,113 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:13:54,113 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:13:54,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:13:54,117 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:13:54" (1/1) ... [2025-04-30 10:13:54,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23465cf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:54, skipping insertion in model container [2025-04-30 10:13:54,118 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:13:54" (1/1) ... [2025-04-30 10:13:54,145 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:13:54,446 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_insert_unequal.i[24872,24885] [2025-04-30 10:13:54,453 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:13:54,462 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:13:54,530 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_insert_unequal.i[24872,24885] [2025-04-30 10:13:54,531 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:13:54,550 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:13:54,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:54 WrapperNode [2025-04-30 10:13:54,551 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:13:54,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:13:54,552 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:13:54,552 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:13:54,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:54" (1/1) ... [2025-04-30 10:13:54,570 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:54" (1/1) ... [2025-04-30 10:13:54,590 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 163 [2025-04-30 10:13:54,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:13:54,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:13:54,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:13:54,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:13:54,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:54" (1/1) ... [2025-04-30 10:13:54,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:54" (1/1) ... [2025-04-30 10:13:54,605 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:54" (1/1) ... [2025-04-30 10:13:54,630 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [2, 18, 10]. 60 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2025-04-30 10:13:54,631 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:54" (1/1) ... [2025-04-30 10:13:54,631 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:54" (1/1) ... [2025-04-30 10:13:54,637 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:54" (1/1) ... [2025-04-30 10:13:54,639 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:54" (1/1) ... [2025-04-30 10:13:54,643 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:54" (1/1) ... [2025-04-30 10:13:54,644 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:54" (1/1) ... [2025-04-30 10:13:54,645 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:54" (1/1) ... [2025-04-30 10:13:54,650 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:13:54,650 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:13:54,651 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:13:54,651 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:13:54,651 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:54" (1/1) ... [2025-04-30 10:13:54,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:13:54,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:13:54,678 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:13:54,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:13:54,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:13:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:13:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-30 10:13:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:13:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:13:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-30 10:13:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-30 10:13:54,697 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-30 10:13:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:13:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:13:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:13:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:13:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:13:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-30 10:13:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:13:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:13:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:13:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:13:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-30 10:13:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-30 10:13:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-30 10:13:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:13:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:13:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:13:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:13:54,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:13:54,792 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:13:54,793 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:13:54,958 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-04-30 10:13:54,958 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:13:54,964 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:13:54,966 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-30 10:13:54,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:13:54 BoogieIcfgContainer [2025-04-30 10:13:54,967 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:13:54,968 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:13:54,969 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:13:54,971 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:13:54,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:13:54" (1/3) ... [2025-04-30 10:13:54,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18eff512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:13:54, skipping insertion in model container [2025-04-30 10:13:54,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:13:54" (2/3) ... [2025-04-30 10:13:54,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18eff512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:13:54, skipping insertion in model container [2025-04-30 10:13:54,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:13:54" (3/3) ... [2025-04-30 10:13:54,974 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2025-04-30 10:13:54,983 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:13:54,985 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_insert_unequal.i that has 2 procedures, 38 locations, 57 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-30 10:13:55,020 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:13:55,029 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@69687dbb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:13:55,029 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-30 10:13:55,032 INFO L278 IsEmpty]: Start isEmpty. Operand has 38 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:13:55,036 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-30 10:13:55,036 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:13:55,037 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:13:55,037 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:13:55,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:13:55,041 INFO L85 PathProgramCache]: Analyzing trace with hash 676978539, now seen corresponding path program 1 times [2025-04-30 10:13:55,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:13:55,045 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927684612] [2025-04-30 10:13:55,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:55,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:13:55,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:13:55,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:13:55,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:55,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:55,371 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:13:55,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:55,372 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927684612] [2025-04-30 10:13:55,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927684612] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:13:55,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:13:55,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:13:55,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819478826] [2025-04-30 10:13:55,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:13:55,378 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:13:55,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:13:55,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:13:55,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:13:55,394 INFO L87 Difference]: Start difference. First operand has 38 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:13:55,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:13:55,419 INFO L93 Difference]: Finished difference Result 72 states and 103 transitions. [2025-04-30 10:13:55,420 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:13:55,421 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2025-04-30 10:13:55,422 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:13:55,426 INFO L225 Difference]: With dead ends: 72 [2025-04-30 10:13:55,426 INFO L226 Difference]: Without dead ends: 34 [2025-04-30 10:13:55,428 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:13:55,431 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:13:55,432 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 93 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:13:55,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-04-30 10:13:55,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2025-04-30 10:13:55,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:13:55,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2025-04-30 10:13:55,462 INFO L79 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 24 [2025-04-30 10:13:55,462 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:13:55,462 INFO L485 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2025-04-30 10:13:55,462 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:13:55,462 INFO L278 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2025-04-30 10:13:55,463 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-30 10:13:55,463 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:13:55,463 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:13:55,463 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:13:55,463 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:13:55,464 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:13:55,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1891880771, now seen corresponding path program 1 times [2025-04-30 10:13:55,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:13:55,464 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110640203] [2025-04-30 10:13:55,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:55,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:13:55,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-30 10:13:55,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-30 10:13:55,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:55,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:55,597 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-30 10:13:55,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:55,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110640203] [2025-04-30 10:13:55,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110640203] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:13:55,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:13:55,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:13:55,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200041231] [2025-04-30 10:13:55,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:13:55,599 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:13:55,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:13:55,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:13:55,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:13:55,599 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-30 10:13:55,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:13:55,616 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2025-04-30 10:13:55,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:13:55,617 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2025-04-30 10:13:55,617 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:13:55,617 INFO L225 Difference]: With dead ends: 46 [2025-04-30 10:13:55,618 INFO L226 Difference]: Without dead ends: 34 [2025-04-30 10:13:55,618 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:13:55,619 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:13:55,619 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:13:55,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-04-30 10:13:55,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-04-30 10:13:55,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:13:55,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-04-30 10:13:55,624 INFO L79 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 32 [2025-04-30 10:13:55,624 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:13:55,625 INFO L485 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-04-30 10:13:55,625 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-30 10:13:55,625 INFO L278 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-04-30 10:13:55,626 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-30 10:13:55,626 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:13:55,626 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:13:55,627 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:13:55,627 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:13:55,627 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:13:55,628 INFO L85 PathProgramCache]: Analyzing trace with hash 942551853, now seen corresponding path program 1 times [2025-04-30 10:13:55,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:13:55,628 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500437810] [2025-04-30 10:13:55,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:55,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:13:55,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:13:55,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:13:55,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:55,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:57,385 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:13:57,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:57,386 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500437810] [2025-04-30 10:13:57,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500437810] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:13:57,386 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093469559] [2025-04-30 10:13:57,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:57,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:13:57,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:13:57,388 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) [2025-04-30 10:13:57,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:13:57,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:13:57,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:13:57,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:57,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:57,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-04-30 10:13:57,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:13:57,630 INFO L354 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 6 treesize of output 5 [2025-04-30 10:13:57,847 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:13:57,923 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-30 10:13:57,923 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-30 10:13:57,976 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-04-30 10:13:58,044 INFO L354 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 18 treesize of output 13 [2025-04-30 10:13:58,229 INFO L354 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 17 treesize of output 3 [2025-04-30 10:13:58,233 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:13:58,303 INFO L325 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-04-30 10:13:58,303 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-04-30 10:13:58,314 INFO L354 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 26 treesize of output 21 [2025-04-30 10:13:58,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:13:58,504 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2025-04-30 10:13:58,509 INFO L354 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 26 treesize of output 21 [2025-04-30 10:13:58,564 INFO L354 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 25 treesize of output 17 [2025-04-30 10:13:58,567 INFO L354 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 21 treesize of output 13 [2025-04-30 10:13:58,642 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:13:58,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:14:00,265 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_240 (Array Int Int)) (v_ArrVal_239 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_239)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_240) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2025-04-30 10:14:01,960 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_240 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_9| Int) (v_ArrVal_239 Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_9| v_ArrVal_239)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_240) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data~0#1|) (< |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_9|))) is different from false [2025-04-30 10:14:02,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093469559] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:14:02,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:14:02,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 41 [2025-04-30 10:14:02,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411614393] [2025-04-30 10:14:02,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:14:02,173 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-30 10:14:02,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:14:02,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-30 10:14:02,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1844, Unknown=10, NotChecked=174, Total=2162 [2025-04-30 10:14:02,175 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 41 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 33 states have internal predecessors, (50), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:14:03,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:14:03,236 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2025-04-30 10:14:03,236 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-30 10:14:03,236 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 33 states have internal predecessors, (50), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 33 [2025-04-30 10:14:03,237 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:14:03,237 INFO L225 Difference]: With dead ends: 56 [2025-04-30 10:14:03,237 INFO L226 Difference]: Without dead ends: 54 [2025-04-30 10:14:03,238 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=261, Invalid=3159, Unknown=10, NotChecked=230, Total=3660 [2025-04-30 10:14:03,239 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 66 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:14:03,239 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 442 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-30 10:14:03,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-04-30 10:14:03,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2025-04-30 10:14:03,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:14:03,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2025-04-30 10:14:03,244 INFO L79 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 33 [2025-04-30 10:14:03,244 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:14:03,244 INFO L485 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2025-04-30 10:14:03,244 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 33 states have internal predecessors, (50), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:14:03,244 INFO L278 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2025-04-30 10:14:03,245 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-30 10:14:03,246 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:14:03,246 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:14:03,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-30 10:14:03,446 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:14:03,447 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:14:03,447 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:14:03,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1578126467, now seen corresponding path program 2 times [2025-04-30 10:14:03,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:14:03,447 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981227239] [2025-04-30 10:14:03,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:14:03,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:14:03,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-30 10:14:03,469 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:14:03,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:14:03,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:03,593 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-30 10:14:03,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:14:03,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981227239] [2025-04-30 10:14:03,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981227239] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:14:03,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683911889] [2025-04-30 10:14:03,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:14:03,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:14:03,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:14:03,596 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) [2025-04-30 10:14:03,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:14:03,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-30 10:14:03,708 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:14:03,709 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:14:03,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:03,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-30 10:14:03,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:14:03,736 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-30 10:14:03,737 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:14:03,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683911889] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:14:03,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:14:03,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2025-04-30 10:14:03,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810104786] [2025-04-30 10:14:03,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:14:03,738 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:14:03,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:14:03,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:14:03,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:14:03,739 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:14:03,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:14:03,766 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2025-04-30 10:14:03,767 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:14:03,767 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2025-04-30 10:14:03,767 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:14:03,767 INFO L225 Difference]: With dead ends: 55 [2025-04-30 10:14:03,767 INFO L226 Difference]: Without dead ends: 39 [2025-04-30 10:14:03,767 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:14:03,768 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 24 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:14:03,768 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 81 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:14:03,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-04-30 10:14:03,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2025-04-30 10:14:03,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:14:03,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2025-04-30 10:14:03,777 INFO L79 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 34 [2025-04-30 10:14:03,778 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:14:03,778 INFO L485 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2025-04-30 10:14:03,778 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:14:03,778 INFO L278 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2025-04-30 10:14:03,778 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-30 10:14:03,778 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:14:03,778 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:14:03,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:14:03,979 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-30 10:14:03,979 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:14:03,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:14:03,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1314025785, now seen corresponding path program 1 times [2025-04-30 10:14:03,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:14:03,980 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314409649] [2025-04-30 10:14:03,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:14:03,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:14:03,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:14:03,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:14:03,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:14:03,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:04,057 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-30 10:14:04,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:14:04,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314409649] [2025-04-30 10:14:04,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314409649] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:14:04,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:14:04,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:14:04,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612104481] [2025-04-30 10:14:04,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:14:04,058 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:14:04,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:14:04,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:14:04,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:14:04,058 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:14:04,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:14:04,078 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2025-04-30 10:14:04,078 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:14:04,079 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2025-04-30 10:14:04,079 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:14:04,079 INFO L225 Difference]: With dead ends: 53 [2025-04-30 10:14:04,079 INFO L226 Difference]: Without dead ends: 38 [2025-04-30 10:14:04,079 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:14:04,080 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 24 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:14:04,080 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 81 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:14:04,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-30 10:14:04,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-04-30 10:14:04,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:14:04,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2025-04-30 10:14:04,094 INFO L79 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 34 [2025-04-30 10:14:04,094 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:14:04,094 INFO L485 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2025-04-30 10:14:04,094 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:14:04,094 INFO L278 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2025-04-30 10:14:04,094 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-30 10:14:04,094 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:14:04,094 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:14:04,095 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:14:04,095 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:14:04,095 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:14:04,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1208918065, now seen corresponding path program 1 times [2025-04-30 10:14:04,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:14:04,095 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532885337] [2025-04-30 10:14:04,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:14:04,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:14:04,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:14:04,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:14:04,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:14:04,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:04,286 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:14:04,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:14:04,286 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532885337] [2025-04-30 10:14:04,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532885337] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:14:04,287 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002147398] [2025-04-30 10:14:04,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:14:04,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:14:04,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:14:04,289 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:14:04,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:14:04,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:14:04,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:14:04,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:14:04,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:04,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-30 10:14:04,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:14:04,461 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-04-30 10:14:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:14:04,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:14:04,511 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:14:04,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002147398] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:14:04,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:14:04,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 14 [2025-04-30 10:14:04,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140069224] [2025-04-30 10:14:04,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:14:04,512 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:14:04,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:14:04,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:14:04,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:14:04,512 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-30 10:14:08,526 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:14:12,535 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:14:16,546 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:14:20,654 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:14:20,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:14:20,658 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2025-04-30 10:14:20,658 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:14:20,658 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2025-04-30 10:14:20,658 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:14:20,659 INFO L225 Difference]: With dead ends: 54 [2025-04-30 10:14:20,659 INFO L226 Difference]: Without dead ends: 40 [2025-04-30 10:14:20,660 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:14:20,660 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 25 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:14:20,660 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 268 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2025-04-30 10:14:20,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-04-30 10:14:20,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-04-30 10:14:20,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:14:20,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-04-30 10:14:20,664 INFO L79 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 35 [2025-04-30 10:14:20,665 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:14:20,665 INFO L485 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-04-30 10:14:20,665 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-30 10:14:20,665 INFO L278 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2025-04-30 10:14:20,665 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-30 10:14:20,665 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:14:20,665 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:14:20,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-30 10:14:20,870 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:14:20,870 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:14:20,870 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:14:20,870 INFO L85 PathProgramCache]: Analyzing trace with hash -933531162, now seen corresponding path program 1 times [2025-04-30 10:14:20,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:14:20,870 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932375280] [2025-04-30 10:14:20,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:14:20,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:14:20,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:14:20,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:14:20,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:14:20,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:21,068 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-30 10:14:21,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:14:21,069 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932375280] [2025-04-30 10:14:21,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932375280] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:14:21,069 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840897296] [2025-04-30 10:14:21,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:14:21,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:14:21,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:14:21,071 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:14:21,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:14:21,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:14:21,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:14:21,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:14:21,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:21,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-30 10:14:21,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:14:21,217 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-30 10:14:21,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:14:21,277 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-30 10:14:21,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840897296] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:14:21,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:14:21,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2025-04-30 10:14:21,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238223963] [2025-04-30 10:14:21,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:14:21,277 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:14:21,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:14:21,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:14:21,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:14:21,278 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-04-30 10:14:21,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:14:21,369 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2025-04-30 10:14:21,369 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:14:21,370 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 36 [2025-04-30 10:14:21,370 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:14:21,370 INFO L225 Difference]: With dead ends: 51 [2025-04-30 10:14:21,370 INFO L226 Difference]: Without dead ends: 40 [2025-04-30 10:14:21,370 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:14:21,371 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 23 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:14:21,371 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 169 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:14:21,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-04-30 10:14:21,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2025-04-30 10:14:21,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:14:21,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-04-30 10:14:21,379 INFO L79 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 36 [2025-04-30 10:14:21,379 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:14:21,379 INFO L485 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-04-30 10:14:21,379 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-04-30 10:14:21,379 INFO L278 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-04-30 10:14:21,380 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-30 10:14:21,380 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:14:21,380 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:14:21,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-30 10:14:21,580 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:14:21,581 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:14:21,581 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:14:21,581 INFO L85 PathProgramCache]: Analyzing trace with hash -933456700, now seen corresponding path program 1 times [2025-04-30 10:14:21,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:14:21,582 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141437577] [2025-04-30 10:14:21,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:14:21,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:14:21,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:14:21,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:14:21,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:14:21,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:22,354 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:14:22,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:14:22,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141437577] [2025-04-30 10:14:22,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141437577] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:14:22,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821541047] [2025-04-30 10:14:22,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:14:22,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:14:22,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:14:22,357 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:14:22,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:14:22,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:14:22,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:14:22,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:14:22,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:22,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-04-30 10:14:22,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:14:22,556 INFO L354 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 6 treesize of output 5 [2025-04-30 10:14:22,745 INFO L354 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 [2025-04-30 10:14:22,833 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:14:22,901 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-30 10:14:22,902 INFO L354 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 15 treesize of output 15 [2025-04-30 10:14:23,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:14:23,125 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 44 treesize of output 35 [2025-04-30 10:14:23,130 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-04-30 10:14:23,136 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-04-30 10:14:23,148 INFO L325 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-04-30 10:14:23,148 INFO L354 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 1 case distinctions, treesize of input 93 treesize of output 62 [2025-04-30 10:14:23,153 INFO L354 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 0 case distinctions, treesize of input 34 treesize of output 19 [2025-04-30 10:14:23,159 INFO L354 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 36 treesize of output 15 [2025-04-30 10:14:23,167 INFO L354 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 20 treesize of output 1 [2025-04-30 10:14:23,243 INFO L354 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 50 treesize of output 30 [2025-04-30 10:14:23,392 INFO L354 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 27 treesize of output 15 [2025-04-30 10:14:23,398 INFO L354 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 7 treesize of output 3 [2025-04-30 10:14:23,460 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:14:23,461 INFO L354 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 22 treesize of output 14 [2025-04-30 10:14:23,489 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:14:23,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:14:23,632 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:14:23,632 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 62 [2025-04-30 10:14:23,645 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:14:23,646 INFO L354 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 120 treesize of output 123 [2025-04-30 10:14:23,653 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:14:23,654 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 92 [2025-04-30 10:14:23,659 INFO L354 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 44 treesize of output 38 [2025-04-30 10:14:23,678 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:14:23,678 INFO L354 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 158 treesize of output 149 [2025-04-30 10:14:23,688 INFO L354 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 29 treesize of output 23 [2025-04-30 10:14:24,493 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse28 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (= .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (.cse9 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|)) (.cse8 (+ .cse28 4))) (let ((.cse19 (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_35 Int) (v_arrayElimCell_32 Int)) (let ((.cse33 (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_811) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_812))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse33 v_arrayElimCell_32) (+ 4 v_arrayElimCell_35))) (not (= v_ArrVal_812 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (not (= v_ArrVal_811 (store .cse9 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_811 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|)))) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse33 .cse7) .cse8)))))) (.cse13 (not .cse12)) (.cse4 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))) (let ((.cse1 (or .cse12 (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_31 Int)) (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_811))) (let ((.cse32 (store .cse31 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_812))) (or (not (= v_ArrVal_811 (store .cse9 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_811 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|)))) (not (= (store (select .cse31 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_812)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse32 v_arrayElimCell_31) .cse4)) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse32 .cse7) .cse8)))))))) (.cse3 (forall ((v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_31 Int)) (or (not (= v_ArrVal_811 (store .cse9 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_811 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|)))) (forall ((v_ArrVal_812 (Array Int Int))) (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_811))) (let ((.cse30 (store .cse29 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_812))) (or (not (= (store (select .cse29 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_812)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse30 v_arrayElimCell_31) .cse4)) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse30 .cse7) .cse8)) (forall ((v_arrayElimCell_35 Int) (v_arrayElimCell_32 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse30 v_arrayElimCell_32) (+ 4 v_arrayElimCell_35))))))))))) (.cse10 (= .cse28 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|)) (.cse2 (or .cse19 .cse13)) (.cse16 (or .cse12 (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_811))) (or (not (= v_ArrVal_811 (store .cse9 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_811 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|)))) (not (= (store (select .cse27 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_812)) (< |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse27 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_812) .cse7) .cse8)) (= (select v_ArrVal_812 (+ 4 v_arrayElimCell_34)) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (.cse17 (or .cse12 (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_31 Int) (v_arrayElimCell_34 Int)) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_811))) (let ((.cse25 (store .cse26 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_812))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse25 v_arrayElimCell_31) (+ 4 v_arrayElimCell_34))) (not (= v_ArrVal_811 (store .cse9 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_811 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|)))) (not (= (store (select .cse26 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_812)) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse25 .cse7) .cse8)))))))) (.cse18 (forall ((v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_34 Int)) (or (not (= v_ArrVal_811 (store .cse9 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_811 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|)))) (forall ((v_ArrVal_812 (Array Int Int))) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_811))) (let ((.cse24 (store .cse23 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_812))) (or (not (= (store (select .cse23 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_812)) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse24 .cse7) .cse8)) (= (select v_ArrVal_812 (+ 4 v_arrayElimCell_34)) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_35 Int) (v_arrayElimCell_32 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse24 v_arrayElimCell_32) (+ 4 v_arrayElimCell_35))))))))))) (.cse20 (forall ((v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_31 Int) (v_arrayElimCell_34 Int)) (or (not (= v_ArrVal_811 (store .cse9 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_811 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|)))) (forall ((v_ArrVal_812 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_811))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_812))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse21 v_arrayElimCell_31) (+ 4 v_arrayElimCell_34))) (not (= (store (select .cse22 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_812)) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse21 .cse7) .cse8)) (forall ((v_arrayElimCell_35 Int) (v_arrayElimCell_32 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse21 v_arrayElimCell_32) (+ 4 v_arrayElimCell_35))))))))))) (.cse0 (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse7))) (and (or .cse0 (and .cse1 .cse2 .cse3)) (forall ((v_ArrVal_811 (Array Int Int))) (or (forall ((v_ArrVal_812 (Array Int Int))) (let ((.cse5 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_811))) (let ((.cse6 (store .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_812))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_812 .cse4)) (not (= (store (select .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_812)) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse6 .cse7) .cse8)) (forall ((v_arrayElimCell_35 Int) (v_arrayElimCell_32 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse6 v_arrayElimCell_32) (+ 4 v_arrayElimCell_35)))))))) (not (= v_ArrVal_811 (store .cse9 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_811 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|)))))) (or (and .cse1 .cse3) .cse10) (or (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int))) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_811))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_812 .cse4)) (not (= v_ArrVal_811 (store .cse9 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_811 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|)))) (not (= (store (select .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_812)) (< |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_812) .cse7) .cse8))))) .cse12) (or .cse13 (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_35 Int) (v_arrayElimCell_32 Int)) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_811))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_812))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse14 v_arrayElimCell_32) (+ 4 v_arrayElimCell_35))) (not (= v_ArrVal_811 (store .cse9 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_811 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|)))) (not (= (store (select .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_812)) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse14 .cse7) .cse8))))))) (or (and .cse16 .cse17 .cse18 (or .cse0 .cse19 .cse13) .cse20) .cse10) (or (and .cse2 .cse16 .cse17 .cse18 .cse20) .cse0)))))) is different from false [2025-04-30 10:14:25,332 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse25 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (+ .cse25 4)) (.cse12 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (.cse15 (= .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse17 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) (.cse14 (not .cse15)) (.cse18 (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_35 Int) (v_arrayElimCell_32 Int)) (let ((.cse33 (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_811) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_812))) (or (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse33 .cse10) .cse11)) (not (= v_ArrVal_812 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (not (= v_ArrVal_811 (store .cse12 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select v_ArrVal_811 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)))) (= (select (select .cse33 v_arrayElimCell_32) (+ 4 v_arrayElimCell_35)) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (let ((.cse2 (forall ((v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_34 Int)) (or (not (= v_ArrVal_811 (store .cse12 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select v_ArrVal_811 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)))) (forall ((v_ArrVal_812 (Array Int Int))) (let ((.cse32 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_811))) (let ((.cse31 (store .cse32 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_812))) (or (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse31 .cse10) .cse11)) (forall ((v_arrayElimCell_35 Int) (v_arrayElimCell_32 Int)) (= (select (select .cse31 v_arrayElimCell_32) (+ 4 v_arrayElimCell_35)) |c_ULTIMATE.start_main_~uneq~0#1|)) (= (select v_ArrVal_812 (+ 4 v_arrayElimCell_34)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_812 (store (select .cse32 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))))))))))) (.cse3 (or .cse15 (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse30 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_811))) (or (< |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse30 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_812) .cse10) .cse11)) (not (= v_ArrVal_811 (store .cse12 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select v_ArrVal_811 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)))) (= (select v_ArrVal_812 (+ 4 v_arrayElimCell_34)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_812 (store (select .cse30 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))))))))) (.cse4 (forall ((v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_31 Int) (v_arrayElimCell_34 Int)) (or (not (= v_ArrVal_811 (store .cse12 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select v_ArrVal_811 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)))) (forall ((v_ArrVal_812 (Array Int Int))) (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_811))) (let ((.cse28 (store .cse29 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_812))) (or (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse28 .cse10) .cse11)) (forall ((v_arrayElimCell_35 Int) (v_arrayElimCell_32 Int)) (= (select (select .cse28 v_arrayElimCell_32) (+ 4 v_arrayElimCell_35)) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse28 v_arrayElimCell_31) (+ 4 v_arrayElimCell_34))) (not (= v_ArrVal_812 (store (select .cse29 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))))))))))) (.cse5 (or (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_31 Int) (v_arrayElimCell_34 Int)) (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_811))) (let ((.cse26 (store .cse27 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_812))) (or (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse26 .cse10) .cse11)) (not (= v_ArrVal_811 (store .cse12 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select v_ArrVal_811 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse26 v_arrayElimCell_31) (+ 4 v_arrayElimCell_34))) (not (= v_ArrVal_812 (store (select .cse27 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))))))) .cse15)) (.cse6 (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| .cse25)) (.cse1 (or .cse14 .cse18)) (.cse7 (or .cse15 (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_31 Int)) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_811))) (let ((.cse23 (store .cse24 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_812))) (or (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse23 .cse10) .cse11)) (not (= v_ArrVal_811 (store .cse12 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select v_ArrVal_811 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)))) (= (select (select .cse23 v_arrayElimCell_31) .cse17) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_812 (store (select .cse24 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))))))))) (.cse8 (forall ((v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_31 Int)) (or (not (= v_ArrVal_811 (store .cse12 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select v_ArrVal_811 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)))) (forall ((v_ArrVal_812 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_811))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_812))) (or (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse21 .cse10) .cse11)) (forall ((v_arrayElimCell_35 Int) (v_arrayElimCell_32 Int)) (= (select (select .cse21 v_arrayElimCell_32) (+ 4 v_arrayElimCell_35)) |c_ULTIMATE.start_main_~uneq~0#1|)) (= (select (select .cse21 v_arrayElimCell_31) .cse17) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_812 (store (select .cse22 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))))))))))) (.cse0 (= .cse10 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5)) (or .cse6 (and .cse7 .cse8)) (or (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_35 Int) (v_arrayElimCell_32 Int)) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_811))) (let ((.cse9 (store .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_812))) (or (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse9 .cse10) .cse11)) (not (= v_ArrVal_811 (store .cse12 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select v_ArrVal_811 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)))) (= (select (select .cse9 v_arrayElimCell_32) (+ 4 v_arrayElimCell_35)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_812 (store (select .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))))))) .cse14) (or .cse15 (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_811))) (or (< |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse16 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_812) .cse10) .cse11)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_812 .cse17)) (not (= v_ArrVal_811 (store .cse12 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select v_ArrVal_811 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)))) (not (= v_ArrVal_812 (store (select .cse16 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))))))) (or (and .cse2 (or .cse14 .cse0 .cse18) .cse3 .cse4 .cse5) .cse6) (forall ((v_ArrVal_811 (Array Int Int))) (or (not (= v_ArrVal_811 (store .cse12 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select v_ArrVal_811 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)))) (forall ((v_ArrVal_812 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_811))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_812))) (or (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse19 .cse10) .cse11)) (forall ((v_arrayElimCell_35 Int) (v_arrayElimCell_32 Int)) (= (select (select .cse19 v_arrayElimCell_32) (+ 4 v_arrayElimCell_35)) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_812 .cse17)) (not (= v_ArrVal_812 (store (select .cse20 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))))))))) (or (and .cse1 .cse7 .cse8) .cse0)))))) is different from false [2025-04-30 10:14:29,722 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse16 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse34 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse11 (select |c_#memory_int#1| .cse18)) (.cse12 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse17 (+ .cse34 4)) (.cse21 (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| .cse16))) (let ((.cse4 (not .cse21)) (.cse6 (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_35 Int) (v_arrayElimCell_32 Int)) (let ((.cse35 (store (store |c_#memory_int#1| .cse18 v_ArrVal_811) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_812))) (or (not (= v_ArrVal_811 (store .cse11 .cse12 (select v_ArrVal_811 .cse12)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse35 v_arrayElimCell_32) (+ 4 v_arrayElimCell_35))) (not (= v_ArrVal_812 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse35 .cse16) .cse17)))))) (.cse14 (+ |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| 4))) (let ((.cse0 (= .cse12 .cse34)) (.cse3 (forall ((v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_31 Int) (v_arrayElimCell_34 Int)) (or (not (= v_ArrVal_811 (store .cse11 .cse12 (select v_ArrVal_811 .cse12)))) (forall ((v_ArrVal_812 (Array Int Int))) (let ((.cse33 (store |c_#memory_int#1| .cse18 v_ArrVal_811))) (let ((.cse32 (store .cse33 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_812))) (or (forall ((v_arrayElimCell_35 Int) (v_arrayElimCell_32 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse32 v_arrayElimCell_32) (+ 4 v_arrayElimCell_35)))) (not (= v_ArrVal_812 (store (select .cse33 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse32 v_arrayElimCell_31) (+ 4 v_arrayElimCell_34))) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse32 .cse16) .cse17))))))))) (.cse7 (or .cse21 (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse31 (store |c_#memory_int#1| .cse18 v_ArrVal_811))) (or (not (= v_ArrVal_811 (store .cse11 .cse12 (select v_ArrVal_811 .cse12)))) (not (= v_ArrVal_812 (store (select .cse31 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (= (select v_ArrVal_812 (+ 4 v_arrayElimCell_34)) |c_ULTIMATE.start_main_~uneq~0#1|) (< |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse31 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_812) .cse16) .cse17))))))) (.cse8 (or .cse21 (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_31 Int) (v_arrayElimCell_34 Int)) (let ((.cse29 (store |c_#memory_int#1| .cse18 v_ArrVal_811))) (let ((.cse30 (store .cse29 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_812))) (or (not (= v_ArrVal_811 (store .cse11 .cse12 (select v_ArrVal_811 .cse12)))) (not (= v_ArrVal_812 (store (select .cse29 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse30 v_arrayElimCell_31) (+ 4 v_arrayElimCell_34))) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse30 .cse16) .cse17)))))))) (.cse9 (forall ((v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_34 Int)) (or (forall ((v_ArrVal_812 (Array Int Int))) (let ((.cse28 (store |c_#memory_int#1| .cse18 v_ArrVal_811))) (let ((.cse27 (store .cse28 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_812))) (or (forall ((v_arrayElimCell_35 Int) (v_arrayElimCell_32 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse27 v_arrayElimCell_32) (+ 4 v_arrayElimCell_35)))) (not (= v_ArrVal_812 (store (select .cse28 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (= (select v_ArrVal_812 (+ 4 v_arrayElimCell_34)) |c_ULTIMATE.start_main_~uneq~0#1|) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse27 .cse16) .cse17)))))) (not (= v_ArrVal_811 (store .cse11 .cse12 (select v_ArrVal_811 .cse12))))))) (.cse5 (= .cse18 .cse16)) (.cse1 (or .cse21 (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_31 Int)) (let ((.cse25 (store |c_#memory_int#1| .cse18 v_ArrVal_811))) (let ((.cse26 (store .cse25 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_812))) (or (not (= v_ArrVal_811 (store .cse11 .cse12 (select v_ArrVal_811 .cse12)))) (not (= v_ArrVal_812 (store (select .cse25 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse26 v_arrayElimCell_31) .cse14)) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse26 .cse16) .cse17)))))))) (.cse2 (forall ((v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_31 Int)) (or (not (= v_ArrVal_811 (store .cse11 .cse12 (select v_ArrVal_811 .cse12)))) (forall ((v_ArrVal_812 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#1| .cse18 v_ArrVal_811))) (let ((.cse23 (store .cse24 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_812))) (or (forall ((v_arrayElimCell_35 Int) (v_arrayElimCell_32 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse23 v_arrayElimCell_32) (+ 4 v_arrayElimCell_35)))) (not (= v_ArrVal_812 (store (select .cse24 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse23 v_arrayElimCell_31) .cse14)) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse23 .cse16) .cse17))))))))) (.cse10 (or .cse4 .cse6))) (and (or .cse0 (and .cse1 .cse2)) (or .cse0 (and .cse3 (or .cse4 .cse5 .cse6) .cse7 .cse8 .cse9)) (or .cse5 (and .cse3 .cse10 .cse7 .cse8 .cse9)) (forall ((v_ArrVal_811 (Array Int Int))) (or (not (= v_ArrVal_811 (store .cse11 .cse12 (select v_ArrVal_811 .cse12)))) (forall ((v_ArrVal_812 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| .cse18 v_ArrVal_811))) (let ((.cse13 (store .cse15 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_812))) (or (forall ((v_arrayElimCell_35 Int) (v_arrayElimCell_32 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse13 v_arrayElimCell_32) (+ 4 v_arrayElimCell_35)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_812 .cse14)) (not (= v_ArrVal_812 (store (select .cse15 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse13 .cse16) .cse17)))))))) (or .cse5 (and .cse1 .cse2 .cse10)) (or .cse4 (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_arrayElimCell_35 Int) (v_arrayElimCell_32 Int)) (let ((.cse19 (store |c_#memory_int#1| .cse18 v_ArrVal_811))) (let ((.cse20 (store .cse19 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_812))) (or (not (= v_ArrVal_811 (store .cse11 .cse12 (select v_ArrVal_811 .cse12)))) (not (= v_ArrVal_812 (store (select .cse19 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse20 v_arrayElimCell_32) (+ 4 v_arrayElimCell_35))) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse20 .cse16) .cse17))))))) (or .cse21 (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#1| .cse18 v_ArrVal_811))) (or (not (= v_ArrVal_811 (store .cse11 .cse12 (select v_ArrVal_811 .cse12)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_812 .cse14)) (not (= v_ArrVal_812 (store (select .cse22 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_812 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (< |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse22 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_812) .cse16) .cse17))))))))))) is different from false [2025-04-30 10:14:33,578 INFO L325 Elim1Store]: treesize reduction 1864, result has 17.7 percent of original size [2025-04-30 10:14:33,579 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 21 select indices, 21 select index equivalence classes, 0 disjoint index pairs (out of 210 index pairs), introduced 22 new quantified variables, introduced 232 case distinctions, treesize of input 6840 treesize of output 6740 [2025-04-30 10:14:33,976 INFO L204 Elim1Store]: Index analysis took 168 ms [2025-04-30 10:14:36,722 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:14:36,723 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 22 select indices, 22 select index equivalence classes, 0 disjoint index pairs (out of 231 index pairs), introduced 22 new quantified variables, introduced 231 case distinctions, treesize of input 3636 treesize of output 5468 Killed by 15