./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-simple/sll2n_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/sll2n_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 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:14:31,728 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:14:31,786 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-30 10:14:31,792 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:14:31,792 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:14:31,814 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:14:31,815 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:14:31,815 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:14:31,816 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:14:31,816 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:14:31,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:14:31,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:14:31,816 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:14:31,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:14:31,817 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:14:31,817 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:14:31,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:14:31,818 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:14:31,818 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:14:31,818 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:14:31,818 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:14:31,818 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:14:31,819 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:14:31,819 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:14:31,819 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:14:31,819 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:14:31,819 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:14:31,819 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:14:31,819 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:14:31,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:14:31,819 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:14:31,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:14:31,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:14:31,820 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:14:31,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:14:31,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:14:31,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:14:31,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:14:31,820 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:14:31,821 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:14:31,821 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:14:31,821 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:14:31,821 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:14:31,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:14:31,822 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:14:31,822 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:14:31,822 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:14:31,822 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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2025-04-30 10:14:32,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:14:32,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:14:32,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:14:32,036 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:14:32,037 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:14:32,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_insert_unequal.i [2025-04-30 10:14:33,313 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/919c8e8dd/5a8bd2e1b1994012ab3ed841e78ddb52/FLAG55b886c0f [2025-04-30 10:14:33,603 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:14:33,606 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_insert_unequal.i [2025-04-30 10:14:33,618 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/919c8e8dd/5a8bd2e1b1994012ab3ed841e78ddb52/FLAG55b886c0f [2025-04-30 10:14:34,315 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/919c8e8dd/5a8bd2e1b1994012ab3ed841e78ddb52 [2025-04-30 10:14:34,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:14:34,318 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:14:34,319 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:14:34,319 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:14:34,322 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:14:34,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:14:34" (1/1) ... [2025-04-30 10:14:34,323 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50e30f62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:34, skipping insertion in model container [2025-04-30 10:14:34,323 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:14:34" (1/1) ... [2025-04-30 10:14:34,343 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:14:34,571 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/sll2n_insert_unequal.i[24620,24633] [2025-04-30 10:14:34,574 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:14:34,583 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:14:34,628 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/sll2n_insert_unequal.i[24620,24633] [2025-04-30 10:14:34,631 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:14:34,652 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:14:34,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:34 WrapperNode [2025-04-30 10:14:34,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:14:34,654 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:14:34,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:14:34,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:14:34,658 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:14:34" (1/1) ... [2025-04-30 10:14:34,672 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:14:34" (1/1) ... [2025-04-30 10:14:34,688 INFO L138 Inliner]: procedures = 128, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 136 [2025-04-30 10:14:34,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:14:34,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:14:34,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:14:34,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:14:34,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:34" (1/1) ... [2025-04-30 10:14:34,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:34" (1/1) ... [2025-04-30 10:14:34,700 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:34" (1/1) ... [2025-04-30 10:14:34,715 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 13, 5]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 6 writes are split as follows [0, 5, 1]. [2025-04-30 10:14:34,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:34" (1/1) ... [2025-04-30 10:14:34,716 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:34" (1/1) ... [2025-04-30 10:14:34,721 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:34" (1/1) ... [2025-04-30 10:14:34,725 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:34" (1/1) ... [2025-04-30 10:14:34,727 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:34" (1/1) ... [2025-04-30 10:14:34,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:34" (1/1) ... [2025-04-30 10:14:34,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:34" (1/1) ... [2025-04-30 10:14:34,732 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:14:34,732 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:14:34,733 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:14:34,733 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:14:34,733 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:34" (1/1) ... [2025-04-30 10:14:34,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:14:34,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:14:34,761 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:14:34,764 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:14:34,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:14:34,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:14:34,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-30 10:14:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:14:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:14:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-30 10:14:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-30 10:14:34,784 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-30 10:14:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:14:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:14:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:14:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:14:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:14:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-30 10:14:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:14:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:14:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:14:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:14:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-30 10:14:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-30 10:14:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-30 10:14:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:14:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:14:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:14:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:14:34,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:14:34,891 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:14:34,892 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:14:35,055 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-04-30 10:14:35,055 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:14:35,065 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:14:35,065 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:14:35,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:14:35 BoogieIcfgContainer [2025-04-30 10:14:35,065 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:14:35,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:14:35,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:14:35,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:14:35,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:14:34" (1/3) ... [2025-04-30 10:14:35,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e87215e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:14:35, skipping insertion in model container [2025-04-30 10:14:35,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:34" (2/3) ... [2025-04-30 10:14:35,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e87215e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:14:35, skipping insertion in model container [2025-04-30 10:14:35,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:14:35" (3/3) ... [2025-04-30 10:14:35,075 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2025-04-30 10:14:35,086 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:14:35,088 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_insert_unequal.i that has 2 procedures, 31 locations, 44 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-30 10:14:35,125 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:14:35,141 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;@29892b03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:14:35,141 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-30 10:14:35,144 INFO L278 IsEmpty]: Start isEmpty. Operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 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:14:35,150 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:14:35,150 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:14:35,150 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:14:35,151 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:14:35,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:14:35,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1366602992, now seen corresponding path program 1 times [2025-04-30 10:14:35,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:14:35,161 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338611565] [2025-04-30 10:14:35,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:14:35,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:14:35,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:14:35,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:14:35,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:14:35,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:14:35,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:14:35,429 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338611565] [2025-04-30 10:14:35,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338611565] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:14:35,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:14:35,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:14:35,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114315181] [2025-04-30 10:14:35,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:14:35,433 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:14:35,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:14:35,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:14:35,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:14:35,449 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 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) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:14:35,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:14:35,486 INFO L93 Difference]: Finished difference Result 60 states and 82 transitions. [2025-04-30 10:14:35,488 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:14:35,489 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-04-30 10:14:35,490 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:14:35,494 INFO L225 Difference]: With dead ends: 60 [2025-04-30 10:14:35,495 INFO L226 Difference]: Without dead ends: 28 [2025-04-30 10:14:35,497 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:14:35,500 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 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:14:35,503 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 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:14:35,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-04-30 10:14:35,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-04-30 10:14:35,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 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:14:35,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2025-04-30 10:14:35,535 INFO L79 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 18 [2025-04-30 10:14:35,535 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:14:35,535 INFO L485 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2025-04-30 10:14:35,536 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:14:35,536 INFO L278 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2025-04-30 10:14:35,537 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:14:35,537 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:14:35,537 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, 1, 1] [2025-04-30 10:14:35,537 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:14:35,537 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:14:35,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:14:35,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1646251592, now seen corresponding path program 1 times [2025-04-30 10:14:35,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:14:35,538 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432184042] [2025-04-30 10:14:35,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:14:35,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:14:35,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:14:35,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:14:35,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:14:35,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:35,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:14:35,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:14:35,735 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432184042] [2025-04-30 10:14:35,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432184042] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:14:35,735 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223763243] [2025-04-30 10:14:35,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:14:35,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:14:35,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:14:35,738 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:14:35,741 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:14:35,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:14:35,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:14:35,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:14:35,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:35,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:14:35,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:14:35,910 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:14:35,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:14:35,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:14:35,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223763243] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:14:35,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:14:35,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-04-30 10:14:35,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717175758] [2025-04-30 10:14:35,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:14:35,951 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:14:35,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:14:35,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:14:35,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:14:35,951 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-30 10:14:35,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:14:35,978 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2025-04-30 10:14:35,979 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:14:35,980 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2025-04-30 10:14:35,980 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:14:35,980 INFO L225 Difference]: With dead ends: 49 [2025-04-30 10:14:35,980 INFO L226 Difference]: Without dead ends: 29 [2025-04-30 10:14:35,980 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:14:35,981 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:14:35,981 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 112 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:14:35,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-04-30 10:14:35,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-04-30 10:14:35,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 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:35,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2025-04-30 10:14:35,986 INFO L79 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 26 [2025-04-30 10:14:35,986 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:14:35,986 INFO L485 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2025-04-30 10:14:35,986 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-30 10:14:35,986 INFO L278 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2025-04-30 10:14:35,987 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-30 10:14:35,987 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:14:35,987 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:14:35,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:14:36,187 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:14:36,188 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:14:36,188 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:14:36,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1250322048, now seen corresponding path program 2 times [2025-04-30 10:14:36,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:14:36,188 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781756274] [2025-04-30 10:14:36,188 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:14:36,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:14:36,207 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-30 10:14:36,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 34 statements. [2025-04-30 10:14:36,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:14:36,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:36,249 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-30 10:14:36,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:14:36,249 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781756274] [2025-04-30 10:14:36,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781756274] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:14:36,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:14:36,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:14:36,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559865108] [2025-04-30 10:14:36,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:14:36,249 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:14:36,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:14:36,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:14:36,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:14:36,250 INFO L87 Difference]: Start difference. First operand 29 states and 38 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:14:36,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:14:36,267 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2025-04-30 10:14:36,270 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:14:36,270 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2025-04-30 10:14:36,270 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:14:36,270 INFO L225 Difference]: With dead ends: 41 [2025-04-30 10:14:36,271 INFO L226 Difference]: Without dead ends: 31 [2025-04-30 10:14:36,271 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:14:36,271 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 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:14:36,271 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:14:36,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-04-30 10:14:36,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-04-30 10:14:36,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 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:36,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2025-04-30 10:14:36,274 INFO L79 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 34 [2025-04-30 10:14:36,275 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:14:36,275 INFO L485 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2025-04-30 10:14:36,275 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:14:36,275 INFO L278 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2025-04-30 10:14:36,275 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-30 10:14:36,275 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:14:36,275 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:14:36,275 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:14:36,275 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:14:36,276 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:14:36,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1307580350, now seen corresponding path program 1 times [2025-04-30 10:14:36,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:14:36,276 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431925652] [2025-04-30 10:14:36,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:14:36,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:14:36,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:14:36,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:14:36,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:14:36,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:36,471 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-30 10:14:36,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:14:36,472 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431925652] [2025-04-30 10:14:36,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431925652] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:14:36,472 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500536667] [2025-04-30 10:14:36,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:14:36,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:14:36,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:14:36,474 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:36,476 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:36,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:14:36,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:14:36,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:14:36,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:36,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:14:36,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:14:36,645 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-30 10:14:36,646 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:14:36,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500536667] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:14:36,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:14:36,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2025-04-30 10:14:36,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490679945] [2025-04-30 10:14:36,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:14:36,647 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:14:36,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:14:36,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:14:36,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:14:36,648 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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:14:36,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:14:36,669 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2025-04-30 10:14:36,670 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:14:36,670 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 34 [2025-04-30 10:14:36,670 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:14:36,670 INFO L225 Difference]: With dead ends: 43 [2025-04-30 10:14:36,671 INFO L226 Difference]: Without dead ends: 32 [2025-04-30 10:14:36,672 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:14:36,672 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 20 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 64 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:36,672 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 64 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:36,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-04-30 10:14:36,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2025-04-30 10:14:36,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 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:36,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2025-04-30 10:14:36,676 INFO L79 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 34 [2025-04-30 10:14:36,676 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:14:36,676 INFO L485 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2025-04-30 10:14:36,676 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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:14:36,676 INFO L278 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2025-04-30 10:14:36,677 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-30 10:14:36,677 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:14:36,677 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:14:36,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:14:36,877 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:36,877 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:14:36,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:14:36,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1864373300, now seen corresponding path program 1 times [2025-04-30 10:14:36,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:14:36,878 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149853312] [2025-04-30 10:14:36,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:14:36,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:14:36,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:14:36,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:14:36,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:14:36,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:38,062 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:14:38,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:14:38,063 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149853312] [2025-04-30 10:14:38,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149853312] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:14:38,063 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385814864] [2025-04-30 10:14:38,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:14:38,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:14:38,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:14:38,066 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:38,067 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:38,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:14:38,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:14:38,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:14:38,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:38,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-04-30 10:14:38,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:14:38,313 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:38,335 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:38,403 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 23 treesize of output 11 [2025-04-30 10:14:38,565 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:38,570 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 11 treesize of output 3 [2025-04-30 10:14:38,745 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-30 10:14:38,746 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-04-30 10:14:38,776 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-30 10:14:38,777 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:39,036 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2025-04-30 10:14:39,092 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 20 treesize of output 15 [2025-04-30 10:14:39,139 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 19 treesize of output 11 [2025-04-30 10:14:39,201 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:14:39,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:14:39,212 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_435) (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|)))) is different from false [2025-04-30 10:14:44,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385814864] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:14:44,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:14:44,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2025-04-30 10:14:44,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182623640] [2025-04-30 10:14:44,560 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:14:44,561 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-30 10:14:44,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:14:44,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-30 10:14:44,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1254, Unknown=37, NotChecked=72, Total=1482 [2025-04-30 10:14:44,563 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 34 states, 32 states have (on average 1.4375) internal successors, (46), 28 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-30 10:14:45,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:14:45,293 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2025-04-30 10:14:45,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-30 10:14:45,294 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.4375) internal successors, (46), 28 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 35 [2025-04-30 10:14:45,294 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:14:45,294 INFO L225 Difference]: With dead ends: 54 [2025-04-30 10:14:45,295 INFO L226 Difference]: Without dead ends: 52 [2025-04-30 10:14:45,295 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=169, Invalid=1960, Unknown=37, NotChecked=90, Total=2256 [2025-04-30 10:14:45,296 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 28 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:14:45,296 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 302 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-30 10:14:45,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-04-30 10:14:45,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2025-04-30 10:14:45,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 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:45,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2025-04-30 10:14:45,303 INFO L79 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 35 [2025-04-30 10:14:45,303 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:14:45,303 INFO L485 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2025-04-30 10:14:45,303 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.4375) internal successors, (46), 28 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-30 10:14:45,303 INFO L278 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2025-04-30 10:14:45,303 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-30 10:14:45,303 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:14:45,303 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:14:45,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-30 10:14:45,504 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:14:45,504 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:14:45,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:14:45,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1864366356, now seen corresponding path program 1 times [2025-04-30 10:14:45,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:14:45,505 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87988596] [2025-04-30 10:14:45,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:14:45,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:14:45,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:14:45,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:14:45,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:14:45,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:45,793 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-30 10:14:45,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:14:45,793 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87988596] [2025-04-30 10:14:45,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87988596] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:14:45,793 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656937448] [2025-04-30 10:14:45,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:14:45,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:14:45,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:14:45,795 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:45,797 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:45,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:14:45,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:14:45,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:14:45,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:45,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-30 10:14:45,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:14:46,042 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:46,061 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:14:46,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:14:46,143 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-30 10:14:46,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656937448] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:14:46,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:14:46,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 18 [2025-04-30 10:14:46,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542940936] [2025-04-30 10:14:46,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:14:46,144 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:14:46,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:14:46,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:14:46,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:14:46,145 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-30 10:14:50,166 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:54,189 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:14:58,207 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:15:02,291 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:15:02,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:15:02,351 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2025-04-30 10:15:02,351 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:15:02,351 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 35 [2025-04-30 10:15:02,352 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:15:02,352 INFO L225 Difference]: With dead ends: 60 [2025-04-30 10:15:02,352 INFO L226 Difference]: Without dead ends: 54 [2025-04-30 10:15:02,352 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:15:02,353 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 35 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:15:02,353 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 361 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 222 Invalid, 4 Unknown, 0 Unchecked, 16.2s Time] [2025-04-30 10:15:02,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-04-30 10:15:02,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 44. [2025-04-30 10:15:02,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 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:15:02,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2025-04-30 10:15:02,358 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 35 [2025-04-30 10:15:02,359 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:15:02,359 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2025-04-30 10:15:02,359 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-30 10:15:02,359 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2025-04-30 10:15:02,359 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-30 10:15:02,359 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:15:02,359 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:15:02,366 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:15:02,560 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:15:02,560 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:15:02,561 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:15:02,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1807114998, now seen corresponding path program 1 times [2025-04-30 10:15:02,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:15:02,561 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757157806] [2025-04-30 10:15:02,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:15:02,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:15:02,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:15:02,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:15:02,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:15:02,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:15:02,741 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-30 10:15:02,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:15:02,742 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757157806] [2025-04-30 10:15:02,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757157806] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:15:02,742 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808659915] [2025-04-30 10:15:02,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:15:02,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:15:02,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:15:02,744 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:15:02,746 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:15:02,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:15:02,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:15:02,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:15:02,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:15:02,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-30 10:15:02,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:15:02,936 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:15:02,957 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:15:02,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:15:02,988 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-30 10:15:02,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808659915] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:15:02,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:15:02,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 14 [2025-04-30 10:15:02,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625932679] [2025-04-30 10:15:02,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:15:02,990 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:15:02,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:15:02,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:15:02,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:15:02,992 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-30 10:15:07,006 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:15:11,016 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:15:15,036 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:15:19,126 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:15:19,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:15:19,144 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2025-04-30 10:15:19,144 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:15:19,144 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 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:15:19,144 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:15:19,145 INFO L225 Difference]: With dead ends: 62 [2025-04-30 10:15:19,145 INFO L226 Difference]: Without dead ends: 52 [2025-04-30 10:15:19,145 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 65 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:15:19,145 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 32 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:15:19,145 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 359 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2025-04-30 10:15:19,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-04-30 10:15:19,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2025-04-30 10:15:19,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 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:15:19,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2025-04-30 10:15:19,153 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 35 [2025-04-30 10:15:19,153 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:15:19,153 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2025-04-30 10:15:19,153 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-30 10:15:19,153 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2025-04-30 10:15:19,154 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-30 10:15:19,154 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:15:19,154 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:15:19,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-30 10:15:19,360 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:15:19,360 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:15:19,361 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:15:19,361 INFO L85 PathProgramCache]: Analyzing trace with hash 364318720, now seen corresponding path program 2 times [2025-04-30 10:15:19,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:15:19,361 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981401805] [2025-04-30 10:15:19,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:15:19,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:15:19,373 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-30 10:15:19,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:15:19,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:15:19,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:15:19,462 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-30 10:15:19,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:15:19,462 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981401805] [2025-04-30 10:15:19,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981401805] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:15:19,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:15:19,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:15:19,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628741024] [2025-04-30 10:15:19,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:15:19,463 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:15:19,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:15:19,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:15:19,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:15:19,465 INFO L87 Difference]: Start difference. First operand 44 states and 53 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, (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:15:19,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:15:19,489 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2025-04-30 10:15:19,489 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:15:19,490 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, (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 36 [2025-04-30 10:15:19,490 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:15:19,491 INFO L225 Difference]: With dead ends: 54 [2025-04-30 10:15:19,491 INFO L226 Difference]: Without dead ends: 39 [2025-04-30 10:15:19,491 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:15:19,491 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:15:19,492 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 62 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:15:19,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-04-30 10:15:19,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2025-04-30 10:15:19,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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:15:19,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-04-30 10:15:19,500 INFO L79 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 36 [2025-04-30 10:15:19,500 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:15:19,501 INFO L485 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-04-30 10:15:19,501 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, (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:15:19,501 INFO L278 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2025-04-30 10:15:19,501 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-30 10:15:19,502 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:15:19,502 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:15:19,502 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:15:19,503 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:15:19,503 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:15:19,503 INFO L85 PathProgramCache]: Analyzing trace with hash -661354617, now seen corresponding path program 1 times [2025-04-30 10:15:19,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:15:19,503 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156683335] [2025-04-30 10:15:19,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:15:19,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:15:19,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-30 10:15:19,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:15:19,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:15:19,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:15:19,698 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-30 10:15:19,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:15:19,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156683335] [2025-04-30 10:15:19,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156683335] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:15:19,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167749318] [2025-04-30 10:15:19,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:15:19,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:15:19,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:15:19,701 INFO L229 MonitoredProcess]: Starting monitored process 7 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:15:19,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:15:19,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-30 10:15:19,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:15:19,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:15:19,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:15:19,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-30 10:15:19,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:15:19,857 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-30 10:15:19,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:15:19,912 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-30 10:15:19,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167749318] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:15:19,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:15:19,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2025-04-30 10:15:19,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764730893] [2025-04-30 10:15:19,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:15:19,913 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:15:19,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:15:19,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:15:19,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:15:19,914 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:15:20,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:15:20,009 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2025-04-30 10:15:20,009 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:15:20,009 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), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2025-04-30 10:15:20,010 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:15:20,010 INFO L225 Difference]: With dead ends: 46 [2025-04-30 10:15:20,010 INFO L226 Difference]: Without dead ends: 38 [2025-04-30 10:15:20,010 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 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:15:20,012 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 20 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:15:20,012 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 151 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:15:20,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-30 10:15:20,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-04-30 10:15:20,017 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:15:20,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-04-30 10:15:20,018 INFO L79 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 37 [2025-04-30 10:15:20,018 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:15:20,018 INFO L485 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-04-30 10:15:20,018 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), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:15:20,018 INFO L278 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-04-30 10:15:20,019 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-30 10:15:20,019 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:15:20,019 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:15:20,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-30 10:15:20,219 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:15:20,220 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:15:20,220 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:15:20,220 INFO L85 PathProgramCache]: Analyzing trace with hash -661347673, now seen corresponding path program 1 times [2025-04-30 10:15:20,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:15:20,220 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000249459] [2025-04-30 10:15:20,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:15:20,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:15:20,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-30 10:15:20,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:15:20,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:15:20,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:15:21,120 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:15:21,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:15:21,121 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000249459] [2025-04-30 10:15:21,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000249459] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:15:21,121 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314975171] [2025-04-30 10:15:21,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:15:21,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:15:21,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:15:21,123 INFO L229 MonitoredProcess]: Starting monitored process 8 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:15:21,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-30 10:15:21,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-30 10:15:21,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:15:21,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:15:21,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:15:21,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 104 conjuncts are in the unsatisfiable core [2025-04-30 10:15:21,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:15:21,326 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:15:21,474 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:15:21,559 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:15:21,635 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-30 10:15:21,636 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:15:21,845 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 24 treesize of output 11 [2025-04-30 10:15:21,851 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-30 10:15:21,859 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-30 10:15:21,942 INFO L325 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-04-30 10:15:21,943 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 119 treesize of output 76 [2025-04-30 10:15:21,947 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2025-04-30 10:15:21,954 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:15:22,005 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:15:22,069 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:15:22,075 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:15:22,164 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:15:22,164 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:15:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:15:22,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:15:22,317 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1005 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1006)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 .cse1) .cse2)) (not (= v_ArrVal_1006 (let ((.cse3 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_1006 .cse3))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse4 (+ .cse2 4))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1005) .cse1) .cse4)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1007) .cse1) .cse4))))))) is different from false [2025-04-30 10:15:22,329 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:15:22,329 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 67 treesize of output 68 [2025-04-30 10:15:22,343 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:15:22,344 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 130 treesize of output 129 [2025-04-30 10:15:22,352 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:15:22,352 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 106 treesize of output 96 [2025-04-30 10:15:22,358 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 46 treesize of output 38 [2025-04-30 10:15:22,371 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:15:22,372 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 160 treesize of output 145 [2025-04-30 10:15:22,378 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 21 [2025-04-30 10:15:22,778 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse15 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse9)) (.cse10 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4))) (let ((.cse16 (forall ((v_ArrVal_1006 (Array Int Int)) (v_arrayElimCell_29 Int) (v_ArrVal_1003 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse31 (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1006))) (or (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse31 .cse9) .cse10)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse31 v_arrayElimCell_26) v_arrayElimCell_29)) (not (= v_ArrVal_1006 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_1006 .cse7)))))))) (.cse11 (not .cse15))) (let ((.cse1 (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse30 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1003))) (let ((.cse29 (store .cse30 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1006))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_1006 v_arrayElimCell_27)) (forall ((v_arrayElimCell_29 Int) (v_arrayElimCell_26 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse29 v_arrayElimCell_26) v_arrayElimCell_29))) (not (= v_ArrVal_1006 (store (select .cse30 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_1006 .cse7)))) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse29 .cse9) .cse10))))))) (.cse2 (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (v_arrayElimCell_24 Int) (v_arrayElimCell_27 Int)) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1003))) (let ((.cse27 (store .cse28 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1006))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse27 v_arrayElimCell_24) v_arrayElimCell_27)) (forall ((v_arrayElimCell_29 Int) (v_arrayElimCell_26 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse27 v_arrayElimCell_26) v_arrayElimCell_29))) (not (= v_ArrVal_1006 (store (select .cse28 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_1006 .cse7)))) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse27 .cse9) .cse10))))))) (.cse3 (or (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (v_arrayElimCell_24 Int) (v_arrayElimCell_27 Int)) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1003))) (let ((.cse25 (store .cse26 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1006))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse25 v_arrayElimCell_24) v_arrayElimCell_27)) (not (= v_ArrVal_1006 (store (select .cse26 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_1006 .cse7)))) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse25 .cse9) .cse10)))))) .cse15)) (.cse5 (or (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1003))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_1006 v_arrayElimCell_27)) (not (= v_ArrVal_1006 (store (select .cse24 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_1006 .cse7)))) (< |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse24 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1006) .cse9) .cse10))))) .cse15)) (.cse0 (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| .cse9)) (.cse4 (or .cse16 .cse11)) (.cse17 (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| .cse10)) (.cse18 (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (v_arrayElimCell_24 Int)) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1003))) (let ((.cse22 (store .cse23 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1006))) (or (forall ((v_arrayElimCell_29 Int) (v_arrayElimCell_26 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse22 v_arrayElimCell_26) v_arrayElimCell_29))) (not (= v_ArrVal_1006 (store (select .cse23 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_1006 .cse7)))) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse22 .cse9) .cse10)) (= (select (select .cse22 v_arrayElimCell_24) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (.cse19 (or .cse15 (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (v_arrayElimCell_24 Int)) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1003))) (let ((.cse21 (store .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1006))) (or (not (= v_ArrVal_1006 (store (select .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_1006 .cse7)))) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse21 .cse9) .cse10)) (= (select (select .cse21 v_arrayElimCell_24) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|)))))))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5)) (or (forall ((v_ArrVal_1006 (Array Int Int)) (v_arrayElimCell_29 Int) (v_ArrVal_1003 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1003))) (let ((.cse8 (store .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1006))) (or (not (= v_ArrVal_1006 (store (select .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_1006 .cse7)))) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse8 .cse9) .cse10)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse8 v_arrayElimCell_26) v_arrayElimCell_29)))))) .cse11) (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1003 (Array Int Int))) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1003))) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1006))) (or (forall ((v_arrayElimCell_29 Int) (v_arrayElimCell_26 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse12 v_arrayElimCell_26) v_arrayElimCell_29))) (not (= v_ArrVal_1006 (store (select .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_1006 .cse7)))) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse12 .cse9) .cse10)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_1006 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))))) (or (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1003 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1003))) (or (not (= v_ArrVal_1006 (store (select .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_1006 .cse7)))) (< |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1006) .cse9) .cse10)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_1006 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))))) .cse15) (or (and .cse1 .cse2 (or .cse0 .cse16 .cse11) .cse3 .cse5) .cse17) (or .cse0 (and .cse18 .cse19 .cse4)) (or .cse17 (and .cse18 .cse19))))))) is different from false [2025-04-30 10:15:23,310 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse19 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse3)) (.cse1 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse13 (forall ((v_ArrVal_1006 (Array Int Int)) (v_arrayElimCell_29 Int) (v_ArrVal_1003 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse31 (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1006))) (or (not (= v_ArrVal_1006 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1006 .cse1)))) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse31 .cse3) .cse4)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse31 v_arrayElimCell_26) v_arrayElimCell_29)))))) (.cse5 (not .cse19))) (let ((.cse8 (= |c_ULTIMATE.start_sll_insert_~last~0#1.offset| .cse4)) (.cse15 (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (v_arrayElimCell_24 Int)) (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1003))) (let ((.cse30 (store .cse29 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1006))) (or (not (= (store (select .cse29 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1006 .cse1)) v_ArrVal_1006)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse30 v_arrayElimCell_24) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse30 .cse3) .cse4)) (forall ((v_arrayElimCell_29 Int) (v_arrayElimCell_26 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse30 v_arrayElimCell_26) v_arrayElimCell_29)))))))) (.cse16 (or (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (v_arrayElimCell_24 Int)) (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1003))) (let ((.cse28 (store .cse27 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1006))) (or (not (= (store (select .cse27 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1006 .cse1)) v_ArrVal_1006)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse28 v_arrayElimCell_24) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse28 .cse3) .cse4)))))) .cse19)) (.cse9 (or (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1003))) (or (not (= (store (select .cse26 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1006 .cse1)) v_ArrVal_1006)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_1006 v_arrayElimCell_27)) (< |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse26 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1006) .cse3) .cse4))))) .cse19)) (.cse10 (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (v_arrayElimCell_24 Int) (v_arrayElimCell_27 Int)) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1003))) (let ((.cse24 (store .cse25 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1006))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse24 v_arrayElimCell_24) v_arrayElimCell_27)) (not (= (store (select .cse25 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1006 .cse1)) v_ArrVal_1006)) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse24 .cse3) .cse4)) (forall ((v_arrayElimCell_29 Int) (v_arrayElimCell_26 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse24 v_arrayElimCell_26) v_arrayElimCell_29)))))))) (.cse11 (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1003))) (let ((.cse23 (store .cse22 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1006))) (or (not (= (store (select .cse22 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1006 .cse1)) v_ArrVal_1006)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_1006 v_arrayElimCell_27)) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse23 .cse3) .cse4)) (forall ((v_arrayElimCell_29 Int) (v_arrayElimCell_26 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse23 v_arrayElimCell_26) v_arrayElimCell_29)))))))) (.cse12 (or (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (v_arrayElimCell_24 Int) (v_arrayElimCell_27 Int)) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1003))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1006))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse20 v_arrayElimCell_24) v_arrayElimCell_27)) (not (= (store (select .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1006 .cse1)) v_ArrVal_1006)) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse20 .cse3) .cse4)))))) .cse19)) (.cse17 (or .cse13 .cse5)) (.cse14 (= |c_ULTIMATE.start_sll_insert_~last~0#1.base| .cse3))) (and (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1003 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1003))) (let ((.cse2 (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1006))) (or (not (= (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1006 .cse1)) v_ArrVal_1006)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_1006 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse2 .cse3) .cse4)) (forall ((v_arrayElimCell_29 Int) (v_arrayElimCell_26 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse2 v_arrayElimCell_26) v_arrayElimCell_29))))))) (or .cse5 (forall ((v_ArrVal_1006 (Array Int Int)) (v_arrayElimCell_29 Int) (v_ArrVal_1003 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1003))) (let ((.cse7 (store .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1006))) (or (not (= (store (select .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1006 .cse1)) v_ArrVal_1006)) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse7 .cse3) .cse4)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse7 v_arrayElimCell_26) v_arrayElimCell_29))))))) (or .cse8 (and .cse9 .cse10 .cse11 .cse12 (or .cse13 .cse5 .cse14))) (or (and .cse15 .cse16) .cse8) (or .cse14 (and .cse15 .cse16 .cse17)) (or (and .cse9 .cse10 .cse11 .cse12 .cse17) .cse14) (or (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1003 (Array Int Int))) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1003))) (or (not (= (store (select .cse18 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1006 .cse1)) v_ArrVal_1006)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_1006 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (< |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse18 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1006) .cse3) .cse4))))) .cse19)))))) is different from false [2025-04-30 10:15:23,557 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse16 (= |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| .cse1)) (.cse4 (+ 4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (let ((.cse11 (forall ((v_ArrVal_1006 (Array Int Int)) (v_arrayElimCell_29 Int) (v_ArrVal_1003 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse32 (store (store |c_#memory_int#1| .cse5 v_ArrVal_1003) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1006))) (or (not (= v_ArrVal_1006 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse4 (select v_ArrVal_1006 .cse4)))) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse32 .cse1) .cse2)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse32 v_arrayElimCell_26) v_arrayElimCell_29)))))) (.cse6 (not .cse16))) (let ((.cse18 (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (v_arrayElimCell_24 Int)) (let ((.cse31 (store |c_#memory_int#1| .cse5 v_ArrVal_1003))) (let ((.cse30 (store .cse31 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1006))) (or (forall ((v_arrayElimCell_29 Int) (v_arrayElimCell_26 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse30 v_arrayElimCell_26) v_arrayElimCell_29))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse30 v_arrayElimCell_24) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse30 .cse1) .cse2)) (not (= (store (select .cse31 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse4 (select v_ArrVal_1006 .cse4)) v_ArrVal_1006))))))) (.cse20 (or .cse16 (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (v_arrayElimCell_24 Int)) (let ((.cse29 (store |c_#memory_int#1| .cse5 v_ArrVal_1003))) (let ((.cse28 (store .cse29 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1006))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse28 v_arrayElimCell_24) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse28 .cse1) .cse2)) (not (= (store (select .cse29 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse4 (select v_ArrVal_1006 .cse4)) v_ArrVal_1006)))))))) (.cse13 (= .cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (.cse10 (= .cse5 .cse1)) (.cse7 (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse27 (store |c_#memory_int#1| .cse5 v_ArrVal_1003))) (let ((.cse26 (store .cse27 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1006))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_1006 v_arrayElimCell_27)) (forall ((v_arrayElimCell_29 Int) (v_arrayElimCell_26 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse26 v_arrayElimCell_26) v_arrayElimCell_29))) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse26 .cse1) .cse2)) (not (= (store (select .cse27 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse4 (select v_ArrVal_1006 .cse4)) v_ArrVal_1006))))))) (.cse8 (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (v_arrayElimCell_24 Int) (v_arrayElimCell_27 Int)) (let ((.cse25 (store |c_#memory_int#1| .cse5 v_ArrVal_1003))) (let ((.cse24 (store .cse25 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1006))) (or (forall ((v_arrayElimCell_29 Int) (v_arrayElimCell_26 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse24 v_arrayElimCell_26) v_arrayElimCell_29))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse24 v_arrayElimCell_24) v_arrayElimCell_27)) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse24 .cse1) .cse2)) (not (= (store (select .cse25 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse4 (select v_ArrVal_1006 .cse4)) v_ArrVal_1006))))))) (.cse9 (or .cse16 (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse23 (store |c_#memory_int#1| .cse5 v_ArrVal_1003))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_1006 v_arrayElimCell_27)) (< |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse23 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1006) .cse1) .cse2)) (not (= (store (select .cse23 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse4 (select v_ArrVal_1006 .cse4)) v_ArrVal_1006))))))) (.cse19 (or .cse11 .cse6)) (.cse12 (or .cse16 (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (v_arrayElimCell_24 Int) (v_arrayElimCell_27 Int)) (let ((.cse22 (store |c_#memory_int#1| .cse5 v_ArrVal_1003))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1006))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse21 v_arrayElimCell_24) v_arrayElimCell_27)) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse21 .cse1) .cse2)) (not (= (store (select .cse22 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse4 (select v_ArrVal_1006 .cse4)) v_ArrVal_1006))))))))) (and (or (forall ((v_ArrVal_1006 (Array Int Int)) (v_arrayElimCell_29 Int) (v_ArrVal_1003 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse3 (store |c_#memory_int#1| .cse5 v_ArrVal_1003))) (let ((.cse0 (store .cse3 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1006))) (or (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 .cse1) .cse2)) (not (= (store (select .cse3 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse4 (select v_ArrVal_1006 .cse4)) v_ArrVal_1006)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse0 v_arrayElimCell_26) v_arrayElimCell_29)))))) .cse6) (or (and .cse7 .cse8 .cse9 (or .cse10 .cse11 .cse6) .cse12) .cse13) (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1003 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| .cse5 v_ArrVal_1003))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1006))) (or (forall ((v_arrayElimCell_29 Int) (v_arrayElimCell_26 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse14 v_arrayElimCell_26) v_arrayElimCell_29))) (= (select v_ArrVal_1006 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse14 .cse1) .cse2)) (not (= (store (select .cse15 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse4 (select v_ArrVal_1006 .cse4)) v_ArrVal_1006)))))) (or .cse16 (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1003 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#1| .cse5 v_ArrVal_1003))) (or (= (select v_ArrVal_1006 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|) (< |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse17 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1006) .cse1) .cse2)) (not (= (store (select .cse17 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse4 (select v_ArrVal_1006 .cse4)) v_ArrVal_1006)))))) (or .cse10 (and .cse18 .cse19 .cse20)) (or (and .cse18 .cse20) .cse13) (or .cse10 (and .cse7 .cse8 .cse9 .cse19 .cse12))))))) is different from false [2025-04-30 10:15:26,546 INFO L325 Elim1Store]: treesize reduction 1864, result has 17.7 percent of original size [2025-04-30 10:15:26,547 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 6150 treesize of output 6190 [2025-04-30 10:15:26,996 INFO L204 Elim1Store]: Index analysis took 168 ms [2025-04-30 10:15:29,467 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:15:29,468 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 21 select indices, 21 select index equivalence classes, 0 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 210 case distinctions, treesize of input 3058 treesize of output 4742 [2025-04-30 10:15:30,582 INFO L325 Elim1Store]: treesize reduction 24, result has 61.9 percent of original size [2025-04-30 10:15:30,583 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 2835 treesize of output 2865 [2025-04-30 10:15:31,105 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 2826 treesize of output 2824 [2025-04-30 10:15:31,755 INFO L325 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2025-04-30 10:15:31,756 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2824 treesize of output 2837 [2025-04-30 10:15:32,373 INFO L325 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2025-04-30 10:15:32,374 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2817 treesize of output 2830 [2025-04-30 10:15:32,933 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:15:32,934 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 2810 treesize of output 2814 [2025-04-30 10:15:33,651 INFO L325 Elim1Store]: treesize reduction 52, result has 52.3 percent of original size [2025-04-30 10:15:33,651 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 2805 treesize of output 2847 [2025-04-30 10:15:34,775 INFO L325 Elim1Store]: treesize reduction 32, result has 61.4 percent of original size [2025-04-30 10:15:34,776 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 2792 treesize of output 2830 [2025-04-30 10:15:35,432 INFO L325 Elim1Store]: treesize reduction 20, result has 56.5 percent of original size [2025-04-30 10:15:35,433 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2779 treesize of output 2796 [2025-04-30 10:15:36,561 INFO L325 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2025-04-30 10:15:36,562 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2772 treesize of output 2785 [2025-04-30 10:15:37,219 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 2765 treesize of output 2763 [2025-04-30 10:15:37,903 INFO L325 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2025-04-30 10:15:37,903 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2763 treesize of output 2780 [2025-04-30 10:15:38,650 INFO L325 Elim1Store]: treesize reduction 44, result has 65.1 percent of original size [2025-04-30 10:15:38,651 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 2752 treesize of output 2819 [2025-04-30 10:15:39,319 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 2737 treesize of output 2735 [2025-04-30 10:15:40,010 INFO L325 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2025-04-30 10:15:40,010 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2735 treesize of output 2752 [2025-04-30 10:15:40,756 INFO L325 Elim1Store]: treesize reduction 32, result has 61.4 percent of original size [2025-04-30 10:15:40,756 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 2724 treesize of output 2762 [2025-04-30 10:15:41,488 INFO L325 Elim1Store]: treesize reduction 32, result has 61.4 percent of original size [2025-04-30 10:15:41,489 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 2711 treesize of output 2749 [2025-04-30 10:15:42,311 INFO L325 Elim1Store]: treesize reduction 32, result has 51.5 percent of original size [2025-04-30 10:15:42,312 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2698 treesize of output 2719 Killed by 15