./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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 ../sv-benchmarks/c/list-simple/dll2n_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 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:33:40,848 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:33:40,894 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:33:40,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:33:40,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:33:40,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:33:40,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:33:40,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:33:40,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:33:40,915 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:33:40,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:33:40,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:33:40,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:33:40,915 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:33:40,915 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:33:40,915 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:33:40,916 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:33:40,916 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:33:40,916 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:33:40,916 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:33:40,916 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:33:40,916 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:33:40,916 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:33:40,916 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:33:40,916 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:33:40,916 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:33:40,916 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:33:40,916 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:33:40,917 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:33:40,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:33:40,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:33:40,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:33:40,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:33:40,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:33:40,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:33:40,917 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:33:40,917 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:33:40,917 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:33:40,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:33:40,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:33:40,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:33:40,917 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:33:40,917 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:33:40,917 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 -> 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 [2025-03-08 04:33:41,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:33:41,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:33:41,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:33:41,150 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:33:41,150 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:33:41,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2025-03-08 04:33:42,237 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64cc12887/7c2d5272c7b94cc680e07315eddea0a3/FLAG4698d3794 [2025-03-08 04:33:42,530 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:33:42,530 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2025-03-08 04:33:42,547 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64cc12887/7c2d5272c7b94cc680e07315eddea0a3/FLAG4698d3794 [2025-03-08 04:33:42,797 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64cc12887/7c2d5272c7b94cc680e07315eddea0a3 [2025-03-08 04:33:42,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:33:42,800 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:33:42,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:33:42,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:33:42,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:33:42,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:33:42" (1/1) ... [2025-03-08 04:33:42,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@474b80d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:42, skipping insertion in model container [2025-03-08 04:33:42,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:33:42" (1/1) ... [2025-03-08 04:33:42,833 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:33:43,040 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i[24989,25002] [2025-03-08 04:33:43,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:33:43,051 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:33:43,083 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i[24989,25002] [2025-03-08 04:33:43,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:33:43,103 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:33:43,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:43 WrapperNode [2025-03-08 04:33:43,104 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:33:43,104 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:33:43,104 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:33:43,104 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:33:43,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:43" (1/1) ... [2025-03-08 04:33:43,116 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:43" (1/1) ... [2025-03-08 04:33:43,131 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 153 [2025-03-08 04:33:43,132 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:33:43,132 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:33:43,132 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:33:43,132 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:33:43,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:43" (1/1) ... [2025-03-08 04:33:43,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:43" (1/1) ... [2025-03-08 04:33:43,142 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:43" (1/1) ... [2025-03-08 04:33:43,156 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 21, 8]. 68 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 14 writes are split as follows [0, 13, 1]. [2025-03-08 04:33:43,156 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:43" (1/1) ... [2025-03-08 04:33:43,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:43" (1/1) ... [2025-03-08 04:33:43,165 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:43" (1/1) ... [2025-03-08 04:33:43,169 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:43" (1/1) ... [2025-03-08 04:33:43,170 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:43" (1/1) ... [2025-03-08 04:33:43,171 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:43" (1/1) ... [2025-03-08 04:33:43,172 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:33:43,177 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:33:43,177 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:33:43,177 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:33:43,178 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:43" (1/1) ... [2025-03-08 04:33:43,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:33:43,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:33:43,200 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-03-08 04:33:43,202 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-03-08 04:33:43,220 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-03-08 04:33:43,220 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-03-08 04:33:43,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 04:33:43,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 04:33:43,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 04:33:43,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 04:33:43,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 04:33:43,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 04:33:43,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 04:33:43,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:33:43,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 04:33:43,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 04:33:43,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 04:33:43,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 04:33:43,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 04:33:43,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 04:33:43,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 04:33:43,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 04:33:43,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 04:33:43,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 04:33:43,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 04:33:43,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:33:43,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 04:33:43,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 04:33:43,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:33:43,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:33:43,317 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:33:43,318 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:33:43,333 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-03-08 04:33:43,505 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L637: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-03-08 04:33:43,519 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2025-03-08 04:33:43,520 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:33:43,528 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:33:43,528 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:33:43,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:33:43 BoogieIcfgContainer [2025-03-08 04:33:43,528 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:33:43,530 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:33:43,530 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:33:43,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:33:43,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:33:42" (1/3) ... [2025-03-08 04:33:43,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64fb3e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:33:43, skipping insertion in model container [2025-03-08 04:33:43,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:43" (2/3) ... [2025-03-08 04:33:43,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64fb3e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:33:43, skipping insertion in model container [2025-03-08 04:33:43,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:33:43" (3/3) ... [2025-03-08 04:33:43,535 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_insert_unequal.i [2025-03-08 04:33:43,544 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:33:43,545 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_insert_unequal.i that has 2 procedures, 35 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-08 04:33:43,583 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:33:43,590 INFO L333 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;@649c45d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:33:43,590 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:33:43,594 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 32 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:43,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 04:33:43,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:43,598 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:33:43,599 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:43,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:43,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1466592194, now seen corresponding path program 1 times [2025-03-08 04:33:43,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:33:43,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275558274] [2025-03-08 04:33:43,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:43,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:33:43,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 04:33:43,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 04:33:43,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:43,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:43,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:33:43,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:33:43,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275558274] [2025-03-08 04:33:43,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275558274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:33:43,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:33:43,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:33:43,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297216693] [2025-03-08 04:33:43,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:33:43,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:33:43,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:33:43,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:33:43,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:33:43,901 INFO L87 Difference]: Start difference. First operand has 34 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 32 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:43,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:33:43,925 INFO L93 Difference]: Finished difference Result 66 states and 94 transitions. [2025-03-08 04:33:43,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:33:43,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 04:33:43,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:33:43,932 INFO L225 Difference]: With dead ends: 66 [2025-03-08 04:33:43,932 INFO L226 Difference]: Without dead ends: 30 [2025-03-08 04:33:43,934 INFO L434 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-03-08 04:33:43,935 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 87 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-03-08 04:33:43,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 87 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:33:43,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-08 04:33:43,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2025-03-08 04:33:43,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:43,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2025-03-08 04:33:43,953 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 14 [2025-03-08 04:33:43,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:33:43,953 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2025-03-08 04:33:43,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:43,953 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2025-03-08 04:33:43,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 04:33:43,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:43,953 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:33:43,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:33:43,954 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:43,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:43,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1086567513, now seen corresponding path program 1 times [2025-03-08 04:33:43,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:33:43,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606070089] [2025-03-08 04:33:43,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:43,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:33:43,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 04:33:43,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 04:33:43,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:43,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:44,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:33:44,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:33:44,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606070089] [2025-03-08 04:33:44,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606070089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:33:44,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:33:44,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:33:44,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431511187] [2025-03-08 04:33:44,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:33:44,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:33:44,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:33:44,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:33:44,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:33:44,085 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:44,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:33:44,102 INFO L93 Difference]: Finished difference Result 52 states and 73 transitions. [2025-03-08 04:33:44,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:33:44,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-08 04:33:44,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:33:44,103 INFO L225 Difference]: With dead ends: 52 [2025-03-08 04:33:44,103 INFO L226 Difference]: Without dead ends: 29 [2025-03-08 04:33:44,103 INFO L434 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-03-08 04:33:44,103 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:33:44,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:33:44,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-08 04:33:44,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-08 04:33:44,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:44,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2025-03-08 04:33:44,106 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 19 [2025-03-08 04:33:44,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:33:44,106 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2025-03-08 04:33:44,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:44,107 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2025-03-08 04:33:44,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 04:33:44,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:44,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:33:44,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 04:33:44,107 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:44,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:44,107 INFO L85 PathProgramCache]: Analyzing trace with hash 581008888, now seen corresponding path program 1 times [2025-03-08 04:33:44,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:33:44,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680387611] [2025-03-08 04:33:44,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:44,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:33:44,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 04:33:44,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 04:33:44,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:44,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:44,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:33:44,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:33:44,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680387611] [2025-03-08 04:33:44,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680387611] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:33:44,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121018918] [2025-03-08 04:33:44,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:44,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:44,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:33:44,246 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-03-08 04:33:44,247 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-03-08 04:33:44,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 04:33:44,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 04:33:44,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:44,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:44,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 04:33:44,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:33:44,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:33:44,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:33:44,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:33:44,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121018918] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:33:44,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:33:44,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-08 04:33:44,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825959660] [2025-03-08 04:33:44,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:33:44,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:33:44,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:33:44,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:33:44,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:33:44,443 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:44,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:33:44,461 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2025-03-08 04:33:44,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:33:44,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-08 04:33:44,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:33:44,463 INFO L225 Difference]: With dead ends: 49 [2025-03-08 04:33:44,463 INFO L226 Difference]: Without dead ends: 31 [2025-03-08 04:33:44,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 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-03-08 04:33:44,464 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:33:44,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 119 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:33:44,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-08 04:33:44,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-08 04:33:44,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:44,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2025-03-08 04:33:44,468 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 19 [2025-03-08 04:33:44,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:33:44,468 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2025-03-08 04:33:44,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:44,468 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2025-03-08 04:33:44,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 04:33:44,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:44,470 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:33:44,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 04:33:44,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:44,674 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:44,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:44,675 INFO L85 PathProgramCache]: Analyzing trace with hash 740740831, now seen corresponding path program 1 times [2025-03-08 04:33:44,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:33:44,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153681018] [2025-03-08 04:33:44,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:44,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:33:44,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 04:33:44,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 04:33:44,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:44,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:44,776 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:33:44,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:33:44,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153681018] [2025-03-08 04:33:44,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153681018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:33:44,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:33:44,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:33:44,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783070649] [2025-03-08 04:33:44,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:33:44,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:33:44,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:33:44,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:33:44,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:33:44,779 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:44,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:33:44,791 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2025-03-08 04:33:44,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:33:44,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-08 04:33:44,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:33:44,792 INFO L225 Difference]: With dead ends: 43 [2025-03-08 04:33:44,792 INFO L226 Difference]: Without dead ends: 33 [2025-03-08 04:33:44,793 INFO L434 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-03-08 04:33:44,793 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 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-03-08 04:33:44,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:33:44,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-08 04:33:44,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-08 04:33:44,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:44,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2025-03-08 04:33:44,796 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 24 [2025-03-08 04:33:44,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:33:44,796 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2025-03-08 04:33:44,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:44,796 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2025-03-08 04:33:44,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 04:33:44,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:44,796 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] [2025-03-08 04:33:44,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 04:33:44,797 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:44,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:44,797 INFO L85 PathProgramCache]: Analyzing trace with hash 833589016, now seen corresponding path program 1 times [2025-03-08 04:33:44,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:33:44,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312542449] [2025-03-08 04:33:44,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:44,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:33:44,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 04:33:44,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 04:33:44,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:44,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:46,293 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:33:46,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:33:46,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312542449] [2025-03-08 04:33:46,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312542449] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:33:46,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123579044] [2025-03-08 04:33:46,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:46,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:46,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:33:46,297 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-03-08 04:33:46,298 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-03-08 04:33:46,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 04:33:46,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 04:33:46,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:46,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:46,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-03-08 04:33:46,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:33:46,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 04:33:46,771 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 04:33:46,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-08 04:33:46,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-03-08 04:33:46,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2025-03-08 04:33:46,902 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 04:33:46,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-08 04:33:46,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-08 04:33:47,059 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-08 04:33:47,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-08 04:33:47,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2025-03-08 04:33:47,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-08 04:33:47,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2025-03-08 04:33:47,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 26 [2025-03-08 04:33:47,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2025-03-08 04:33:47,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-08 04:33:47,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 04:33:47,536 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:33:47,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:33:47,551 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_479 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_479) (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-03-08 04:33:47,583 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_479 (Array Int Int)) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_479) (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|))) (not (= v_ArrVal_477 (let ((.cse0 (+ |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse0 (select v_ArrVal_477 .cse0))))))) is different from false [2025-03-08 04:33:47,607 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_479 (Array Int Int)) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (or (not (= v_ArrVal_477 (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse0 (select v_ArrVal_477 .cse0)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_475) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse0) v_ArrVal_479) (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-03-08 04:33:47,625 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_479 (Array Int Int)) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (or (not (= (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_477 .cse1)) v_ArrVal_477)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_477) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_475) (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1) v_ArrVal_479) (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-03-08 04:33:47,640 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_479 (Array Int Int)) (v_ArrVal_472 (Array Int Int)) (v_ArrVal_473 (Array Int Int)) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (or (not (= v_ArrVal_477 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_473) .cse0) .cse1 (select v_ArrVal_477 .cse1)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_477) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_475) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_472) .cse0) .cse1) v_ArrVal_479) (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-03-08 04:33:47,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 64 [2025-03-08 04:33:47,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 48 [2025-03-08 04:33:47,872 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_468 (Array Int Int)) (v_ArrVal_479 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_11| Int) (v_ArrVal_472 (Array Int Int)) (v_ArrVal_473 (Array Int Int)) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_468)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_477) |v_ULTIMATE.start_node_create_~temp~0#1.base_11| v_ArrVal_475) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_469) |v_ULTIMATE.start_node_create_~temp~0#1.base_11| v_ArrVal_472) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_479) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_11|) 0)) (not (= (store (select (store .cse0 |v_ULTIMATE.start_node_create_~temp~0#1.base_11| v_ArrVal_473) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_477 .cse1)) v_ArrVal_477))))) is different from false [2025-03-08 04:33:47,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:47,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 52 [2025-03-08 04:33:47,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:47,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 147 [2025-03-08 04:33:47,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 580 treesize of output 526 [2025-03-08 04:33:47,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 50 [2025-03-08 04:33:47,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2025-03-08 04:33:47,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2025-03-08 04:33:47,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 89 [2025-03-08 04:33:47,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:47,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 96 [2025-03-08 04:33:47,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2025-03-08 04:33:47,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:47,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-03-08 04:33:48,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:48,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 59 [2025-03-08 04:33:48,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-08 04:33:48,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-08 04:33:48,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-08 04:33:48,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-08 04:33:48,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2025-03-08 04:33:48,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-03-08 04:33:48,343 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-08 04:33:48,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123579044] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:33:48,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:33:48,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 46 [2025-03-08 04:33:48,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813617291] [2025-03-08 04:33:48,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:33:48,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-08 04:33:48,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:33:48,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-08 04:33:48,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1417, Unknown=9, NotChecked=486, Total=2070 [2025-03-08 04:33:48,346 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 46 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 46 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:49,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:33:49,497 INFO L93 Difference]: Finished difference Result 59 states and 81 transitions. [2025-03-08 04:33:49,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 04:33:49,497 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 46 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-08 04:33:49,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:33:49,498 INFO L225 Difference]: With dead ends: 59 [2025-03-08 04:33:49,499 INFO L226 Difference]: Without dead ends: 57 [2025-03-08 04:33:49,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=258, Invalid=2013, Unknown=9, NotChecked=582, Total=2862 [2025-03-08 04:33:49,501 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 45 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 1493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 423 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 04:33:49,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 324 Invalid, 1493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1060 Invalid, 0 Unknown, 423 Unchecked, 0.8s Time] [2025-03-08 04:33:49,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-08 04:33:49,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 39. [2025-03-08 04:33:49,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:49,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2025-03-08 04:33:49,508 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 25 [2025-03-08 04:33:49,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:33:49,508 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2025-03-08 04:33:49,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 46 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:49,509 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2025-03-08 04:33:49,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 04:33:49,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:49,510 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] [2025-03-08 04:33:49,518 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-03-08 04:33:49,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:49,711 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:49,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:49,711 INFO L85 PathProgramCache]: Analyzing trace with hash 833583064, now seen corresponding path program 1 times [2025-03-08 04:33:49,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:33:49,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017877420] [2025-03-08 04:33:49,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:49,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:33:49,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 04:33:49,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 04:33:49,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:49,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:50,012 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 04:33:50,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:33:50,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017877420] [2025-03-08 04:33:50,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017877420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:33:50,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:33:50,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 04:33:50,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247875124] [2025-03-08 04:33:50,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:33:50,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 04:33:50,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:33:50,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 04:33:50,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 04:33:50,013 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:50,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:33:50,138 INFO L93 Difference]: Finished difference Result 78 states and 109 transitions. [2025-03-08 04:33:50,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 04:33:50,138 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-08 04:33:50,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:33:50,139 INFO L225 Difference]: With dead ends: 78 [2025-03-08 04:33:50,139 INFO L226 Difference]: Without dead ends: 47 [2025-03-08 04:33:50,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-08 04:33:50,139 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 42 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:33:50,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 123 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:33:50,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-08 04:33:50,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2025-03-08 04:33:50,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:50,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2025-03-08 04:33:50,146 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 25 [2025-03-08 04:33:50,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:33:50,146 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2025-03-08 04:33:50,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:50,147 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2025-03-08 04:33:50,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 04:33:50,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:50,147 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] [2025-03-08 04:33:50,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 04:33:50,147 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:50,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:50,148 INFO L85 PathProgramCache]: Analyzing trace with hash 861420854, now seen corresponding path program 1 times [2025-03-08 04:33:50,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:33:50,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886909987] [2025-03-08 04:33:50,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:50,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:33:50,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 04:33:50,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 04:33:50,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:50,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:50,243 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:33:50,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:33:50,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886909987] [2025-03-08 04:33:50,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886909987] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:33:50,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456724902] [2025-03-08 04:33:50,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:50,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:50,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:33:50,246 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-03-08 04:33:50,248 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-03-08 04:33:50,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 04:33:50,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 04:33:50,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:50,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:50,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 04:33:50,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:33:50,374 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:33:50,374 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:33:50,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456724902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:33:50,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 04:33:50,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2025-03-08 04:33:50,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061365981] [2025-03-08 04:33:50,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:33:50,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:33:50,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:33:50,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:33:50,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:33:50,375 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:50,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:33:50,392 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2025-03-08 04:33:50,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:33:50,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-08 04:33:50,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:33:50,393 INFO L225 Difference]: With dead ends: 54 [2025-03-08 04:33:50,394 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 04:33:50,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-03-08 04:33:50,394 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 26 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:33:50,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 61 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:33:50,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 04:33:50,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2025-03-08 04:33:50,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:50,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2025-03-08 04:33:50,404 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 25 [2025-03-08 04:33:50,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:33:50,404 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2025-03-08 04:33:50,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:50,404 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2025-03-08 04:33:50,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 04:33:50,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:50,405 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:33:50,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 04:33:50,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:50,605 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:50,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:50,606 INFO L85 PathProgramCache]: Analyzing trace with hash -583084545, now seen corresponding path program 2 times [2025-03-08 04:33:50,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:33:50,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051039692] [2025-03-08 04:33:50,606 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:33:50,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:33:50,621 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-08 04:33:50,628 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 04:33:50,628 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:33:50,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:50,690 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:33:50,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:33:50,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051039692] [2025-03-08 04:33:50,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051039692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:33:50,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:33:50,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:33:50,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234171236] [2025-03-08 04:33:50,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:33:50,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:33:50,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:33:50,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:33:50,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:33:50,691 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:50,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:33:50,707 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2025-03-08 04:33:50,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:33:50,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-08 04:33:50,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:33:50,707 INFO L225 Difference]: With dead ends: 53 [2025-03-08 04:33:50,707 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 04:33:50,708 INFO L434 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-03-08 04:33:50,708 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 25 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:33:50,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 63 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:33:50,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 04:33:50,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2025-03-08 04:33:50,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2025-03-08 04:33:50,712 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 26 [2025-03-08 04:33:50,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:33:50,712 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2025-03-08 04:33:50,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:50,712 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2025-03-08 04:33:50,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 04:33:50,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:50,712 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-03-08 04:33:50,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 04:33:50,712 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:50,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:50,713 INFO L85 PathProgramCache]: Analyzing trace with hash -555252707, now seen corresponding path program 1 times [2025-03-08 04:33:50,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:33:50,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985156386] [2025-03-08 04:33:50,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:50,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:33:50,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 04:33:50,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 04:33:50,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:50,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:50,785 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:33:50,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:33:50,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985156386] [2025-03-08 04:33:50,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985156386] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:33:50,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634143851] [2025-03-08 04:33:50,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:50,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:50,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:33:50,787 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-03-08 04:33:50,789 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-03-08 04:33:50,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 04:33:50,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 04:33:50,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:50,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:50,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 04:33:50,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:33:50,921 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:33:50,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:33:50,973 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:33:50,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634143851] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:33:50,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:33:50,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 04:33:50,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663298776] [2025-03-08 04:33:50,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:33:50,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 04:33:50,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:33:50,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 04:33:50,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:33:50,975 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:51,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:33:51,039 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2025-03-08 04:33:51,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 04:33:51,040 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-08 04:33:51,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:33:51,040 INFO L225 Difference]: With dead ends: 45 [2025-03-08 04:33:51,040 INFO L226 Difference]: Without dead ends: 35 [2025-03-08 04:33:51,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-08 04:33:51,041 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:33:51,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 154 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:33:51,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-08 04:33:51,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-08 04:33:51,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:51,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2025-03-08 04:33:51,048 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 26 [2025-03-08 04:33:51,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:33:51,048 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-03-08 04:33:51,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:51,048 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2025-03-08 04:33:51,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 04:33:51,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:51,048 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-03-08 04:33:51,056 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-03-08 04:33:51,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:51,249 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:51,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:51,249 INFO L85 PathProgramCache]: Analyzing trace with hash -526623556, now seen corresponding path program 1 times [2025-03-08 04:33:51,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:33:51,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920237821] [2025-03-08 04:33:51,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:51,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:33:51,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 04:33:51,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 04:33:51,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:51,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:51,364 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:33:51,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:33:51,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920237821] [2025-03-08 04:33:51,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920237821] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:33:51,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612380427] [2025-03-08 04:33:51,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:51,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:51,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:33:51,366 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-03-08 04:33:51,368 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-03-08 04:33:51,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 04:33:51,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 04:33:51,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:51,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:51,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 04:33:51,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:33:51,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-08 04:33:51,546 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:33:51,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:33:51,561 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:33:51,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612380427] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:33:51,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:33:51,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2025-03-08 04:33:51,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784192011] [2025-03-08 04:33:51,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:33:51,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 04:33:51,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:33:51,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 04:33:51,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 04:33:51,562 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:51,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:33:51,646 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2025-03-08 04:33:51,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 04:33:51,648 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-08 04:33:51,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:33:51,648 INFO L225 Difference]: With dead ends: 43 [2025-03-08 04:33:51,648 INFO L226 Difference]: Without dead ends: 32 [2025-03-08 04:33:51,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-08 04:33:51,649 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:33:51,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 154 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:33:51,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-08 04:33:51,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-08 04:33:51,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:51,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-03-08 04:33:51,656 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 26 [2025-03-08 04:33:51,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:33:51,656 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-03-08 04:33:51,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:51,656 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-03-08 04:33:51,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 04:33:51,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:51,657 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:33:51,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 04:33:51,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 04:33:51,857 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:51,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:51,858 INFO L85 PathProgramCache]: Analyzing trace with hash -2079752455, now seen corresponding path program 1 times [2025-03-08 04:33:51,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:33:51,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778549411] [2025-03-08 04:33:51,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:51,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:33:51,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 04:33:51,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 04:33:51,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:51,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:51,978 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:33:51,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:33:51,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778549411] [2025-03-08 04:33:51,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778549411] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:33:51,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846491523] [2025-03-08 04:33:51,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:51,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:51,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:33:51,980 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-03-08 04:33:51,982 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-03-08 04:33:52,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 04:33:52,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 04:33:52,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:52,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:52,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 04:33:52,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:33:52,165 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:33:52,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:33:52,197 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:33:52,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846491523] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:33:52,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:33:52,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-08 04:33:52,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196687640] [2025-03-08 04:33:52,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:33:52,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 04:33:52,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:33:52,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 04:33:52,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-08 04:33:52,199 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:52,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:33:52,226 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2025-03-08 04:33:52,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 04:33:52,226 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-08 04:33:52,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:33:52,226 INFO L225 Difference]: With dead ends: 39 [2025-03-08 04:33:52,226 INFO L226 Difference]: Without dead ends: 31 [2025-03-08 04:33:52,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-08 04:33:52,227 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:33:52,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 123 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:33:52,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-08 04:33:52,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-08 04:33:52,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2025-03-08 04:33:52,235 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 27 [2025-03-08 04:33:52,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:33:52,235 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2025-03-08 04:33:52,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:52,235 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2025-03-08 04:33:52,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 04:33:52,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:52,235 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, 1] [2025-03-08 04:33:52,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 04:33:52,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:52,436 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:52,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:52,437 INFO L85 PathProgramCache]: Analyzing trace with hash -2079758407, now seen corresponding path program 1 times [2025-03-08 04:33:52,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:33:52,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867313969] [2025-03-08 04:33:52,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:52,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:33:52,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 04:33:52,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 04:33:52,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:52,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:53,583 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:33:53,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:33:53,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867313969] [2025-03-08 04:33:53,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867313969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:33:53,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975192043] [2025-03-08 04:33:53,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:53,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:53,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:33:53,585 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-03-08 04:33:53,587 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-03-08 04:33:53,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 04:33:53,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 04:33:53,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:53,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:53,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 113 conjuncts are in the unsatisfiable core [2025-03-08 04:33:53,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:33:53,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 04:33:54,031 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 04:33:54,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-08 04:33:54,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-03-08 04:33:54,126 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 04:33:54,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2025-03-08 04:33:54,268 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-08 04:33:54,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-08 04:33:54,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 31 [2025-03-08 04:33:54,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-03-08 04:33:54,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:54,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 34 [2025-03-08 04:33:54,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-08 04:33:54,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 49 [2025-03-08 04:33:54,588 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-08 04:33:54,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 82 [2025-03-08 04:33:54,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-03-08 04:33:54,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 19 [2025-03-08 04:33:54,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 40 [2025-03-08 04:33:54,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2025-03-08 04:33:54,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-08 04:33:54,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 37 [2025-03-08 04:33:54,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2025-03-08 04:33:54,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 04:33:54,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 04:33:54,787 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:33:54,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:33:54,849 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1426) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1424) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1425) .cse0) .cse1))))) is different from false [2025-03-08 04:33:54,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:54,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 92 [2025-03-08 04:33:54,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:54,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 346 treesize of output 345 [2025-03-08 04:33:54,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 322 treesize of output 306 [2025-03-08 04:33:54,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 148 [2025-03-08 04:33:55,308 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse25 (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_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (= |c_ULTIMATE.start_dll_insert_~last~0#1.base| .cse5)) (.cse2 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse3 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4)) (.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 4) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse6 (+ .cse25 4))) (let ((.cse26 (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_53 Int) (v_arrayElimCell_55 Int)) (let ((.cse34 (select (store (let ((.cse35 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1417))) (store .cse35 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse35 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_ArrVal_1423) .cse3 v_ArrVal_1421))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1426) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1413) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1424) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 v_arrayElimCell_53)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 v_arrayElimCell_55)))))) (.cse7 (not .cse11)) (.cse22 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse5))) (let ((.cse15 (not .cse22)) (.cse8 (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_55 Int)) (let ((.cse32 (select (store (let ((.cse33 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1417))) (store .cse33 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse33 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_ArrVal_1423) .cse3 v_ArrVal_1421))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1426) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1413) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1424) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 v_arrayElimCell_55)))))) (.cse16 (or (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_53 Int) (v_arrayElimCell_56 Int)) (let ((.cse30 (select (store (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1417))) (store .cse31 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse31 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_ArrVal_1423) .cse3 v_ArrVal_1421))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1426) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1413) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1424) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 v_arrayElimCell_53)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 v_arrayElimCell_56))))) .cse11)) (.cse17 (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_53 Int) (v_arrayElimCell_55 Int)) (let ((.cse28 (select (store (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1417))) (store .cse29 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse29 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_ArrVal_1423) .cse3 v_ArrVal_1421))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1426) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1413) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1424) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 v_arrayElimCell_53)) (forall ((v_arrayElimCell_56 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 v_arrayElimCell_56))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 v_arrayElimCell_55)))))) (.cse18 (or .cse26 .cse7)) (.cse19 (or .cse22 (and .cse26 (or (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_53 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1417))) (store .cse27 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse27 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_ArrVal_1423) .cse3 v_ArrVal_1421))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1426) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1413) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1424) .cse5) .cse6)) v_arrayElimCell_53))) .cse11))))) (and (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_55 Int)) (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1417))) (store .cse1 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse1 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_ArrVal_1423) .cse3 v_ArrVal_1421))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1426) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1413) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1424) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (forall ((v_arrayElimCell_56 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 v_arrayElimCell_56))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 v_arrayElimCell_55))))) (or .cse7 .cse8) (or (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_56 Int)) (let ((.cse9 (select (store (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1417))) (store .cse10 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse10 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_ArrVal_1423) .cse3 v_ArrVal_1421))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1426) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1413) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1424) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse9 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse9 v_arrayElimCell_56))))) .cse11) (or (and (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_55 Int)) (let ((.cse12 (select (store (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1417))) (store .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_ArrVal_1423) .cse3 v_ArrVal_1421))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1426) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1413) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1424) .cse5) .cse6)))) (or (forall ((v_arrayElimCell_56 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 v_arrayElimCell_56))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 v_arrayElimCell_55))))) (or (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_56 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1417))) (store .cse14 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse14 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_ArrVal_1423) .cse3 v_ArrVal_1421))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1426) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1413) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1424) .cse5) .cse6)) v_arrayElimCell_56))) .cse11)) .cse15) (or (= |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| .cse5) (and .cse16 .cse17 .cse18 .cse19 (or .cse15 (let ((.cse20 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (and (or (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_56 Int)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1417) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse20 .cse2 v_ArrVal_1423) .cse3 v_ArrVal_1421)) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1426) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1413) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1424) .cse5) .cse6)) v_arrayElimCell_56) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse11) (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_55 Int)) (let ((.cse21 (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1417) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse20 .cse2 v_ArrVal_1423) .cse3 v_ArrVal_1421)) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1426) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1413) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1424) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 v_arrayElimCell_55)) (forall ((v_arrayElimCell_56 Int)) (= (select .cse21 v_arrayElimCell_56) |c_ULTIMATE.start_main_~uneq~0#1|)))))))))) (or .cse22 (and (or (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1417))) (store .cse23 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse23 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_ArrVal_1423) .cse3 v_ArrVal_1421))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1426) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1413) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1424) .cse5) .cse6)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) .cse11) .cse8)) (or (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1417))) (store .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_ArrVal_1423) .cse3 v_ArrVal_1421))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1426) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1413) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1424) .cse5) .cse6)) v_arrayElimCell_55))) .cse7) (or (= .cse25 |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) (and .cse16 .cse17 .cse18 .cse19))))))) is different from false [2025-03-08 04:33:55,917 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse37 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse38 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse3 (select .cse37 .cse38)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse12 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse2 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4)) (.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse37 .cse38 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse6 (+ .cse12 4)) (.cse17 (= .cse3 .cse5))) (let ((.cse7 (not .cse17)) (.cse26 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse5)) (.cse33 (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_53 Int) (v_arrayElimCell_55 Int)) (let ((.cse35 (select (store (let ((.cse36 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1417))) (store .cse36 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse36 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1423) .cse2 v_ArrVal_1421))) .cse3 v_ArrVal_1426) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1413) .cse3 v_ArrVal_1424) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse35 v_arrayElimCell_53)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse35 v_arrayElimCell_55))))))) (let ((.cse8 (or .cse26 (and .cse33 (or (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_53 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse34 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1417))) (store .cse34 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse34 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1423) .cse2 v_ArrVal_1421))) .cse3 v_ArrVal_1426) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1413) .cse3 v_ArrVal_1424) .cse5) .cse6)) v_arrayElimCell_53))) .cse17)))) (.cse15 (not .cse26)) (.cse9 (or .cse7 .cse33)) (.cse10 (or (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_53 Int) (v_arrayElimCell_56 Int)) (let ((.cse31 (select (store (let ((.cse32 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1417))) (store .cse32 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse32 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1423) .cse2 v_ArrVal_1421))) .cse3 v_ArrVal_1426) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1413) .cse3 v_ArrVal_1424) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 v_arrayElimCell_56)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 v_arrayElimCell_53))))) .cse17)) (.cse11 (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_53 Int) (v_arrayElimCell_55 Int)) (let ((.cse29 (select (store (let ((.cse30 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1417))) (store .cse30 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse30 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1423) .cse2 v_ArrVal_1421))) .cse3 v_ArrVal_1426) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1413) .cse3 v_ArrVal_1424) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 v_arrayElimCell_53)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 v_arrayElimCell_55)) (forall ((v_arrayElimCell_56 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 v_arrayElimCell_56))))))) (.cse20 (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_55 Int)) (let ((.cse27 (select (store (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1417))) (store .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1423) .cse2 v_ArrVal_1421))) .cse3 v_ArrVal_1426) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1413) .cse3 v_ArrVal_1424) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 v_arrayElimCell_55)) (= (select .cse27 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (and (or (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1417))) (store .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1423) .cse2 v_ArrVal_1421))) .cse3 v_ArrVal_1426) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1413) .cse3 v_ArrVal_1424) .cse5) .cse6)) v_arrayElimCell_55))) .cse7) (or (and .cse8 .cse9 .cse10 .cse11) (= |c_ULTIMATE.start_dll_insert_~last~0#1.offset| .cse12)) (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_55 Int)) (let ((.cse13 (select (store (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1417))) (store .cse14 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse14 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1423) .cse2 v_ArrVal_1421))) .cse3 v_ArrVal_1426) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1413) .cse3 v_ArrVal_1424) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 v_arrayElimCell_55)) (forall ((v_arrayElimCell_56 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 v_arrayElimCell_56))) (= (select .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|)))) (or .cse15 (and (or (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_56 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1417))) (store .cse16 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse16 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1423) .cse2 v_ArrVal_1421))) .cse3 v_ArrVal_1426) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1413) .cse3 v_ArrVal_1424) .cse5) .cse6)) v_arrayElimCell_56))) .cse17) (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_55 Int)) (let ((.cse18 (select (store (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1417))) (store .cse19 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse19 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1423) .cse2 v_ArrVal_1421))) .cse3 v_ArrVal_1426) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1413) .cse3 v_ArrVal_1424) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 v_arrayElimCell_55)) (forall ((v_arrayElimCell_56 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 v_arrayElimCell_56)))))))) (or .cse7 .cse20) (or (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_56 Int)) (let ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1417))) (store .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1423) .cse2 v_ArrVal_1421))) .cse3 v_ArrVal_1426) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1413) .cse3 v_ArrVal_1424) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 v_arrayElimCell_56)) (= (select .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse17) (or (= |c_ULTIMATE.start_dll_insert_~last~0#1.base| .cse5) (and .cse8 (or .cse15 (let ((.cse23 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (and (or .cse17 (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_56 Int)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1417) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse23 .cse1 v_ArrVal_1423) .cse2 v_ArrVal_1421)) .cse3 v_ArrVal_1426) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1413) .cse3 v_ArrVal_1424) .cse5) .cse6)) v_arrayElimCell_56) |c_ULTIMATE.start_main_~uneq~0#1|))) (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_55 Int)) (let ((.cse24 (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1417) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse23 .cse1 v_ArrVal_1423) .cse2 v_ArrVal_1421)) .cse3 v_ArrVal_1426) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1413) .cse3 v_ArrVal_1424) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 v_arrayElimCell_55)) (forall ((v_arrayElimCell_56 Int)) (= (select .cse24 v_arrayElimCell_56) |c_ULTIMATE.start_main_~uneq~0#1|)))))))) .cse9 .cse10 .cse11)) (or (and (or (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int)) (= (select (select (store (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1417))) (store .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_ArrVal_1423) .cse2 v_ArrVal_1421))) .cse3 v_ArrVal_1426) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1413) .cse3 v_ArrVal_1424) .cse5) .cse6)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse17) .cse20) .cse26))))))) is different from false [2025-03-08 04:33:56,220 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse39 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse40 (+ .cse14 4))) (let ((.cse6 (select .cse39 .cse40)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse15 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (+ 8 |c_ULTIMATE.start_node_create_#res#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4)) (.cse7 (store |c_#memory_$Pointer$#1.base| .cse5 (store .cse39 .cse40 |c_ULTIMATE.start_node_create_#res#1.base|))) (.cse9 (+ .cse15 4)) (.cse0 (= .cse6 .cse8))) (let ((.cse11 (not .cse0)) (.cse29 (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_53 Int) (v_arrayElimCell_55 Int)) (let ((.cse37 (select (store (let ((.cse38 (store |c_#memory_int#1| .cse5 v_ArrVal_1417))) (store .cse38 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse38 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_ArrVal_1423) .cse4 v_ArrVal_1421))) .cse6 v_ArrVal_1426) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1413) .cse6 v_ArrVal_1424) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse37 v_arrayElimCell_55)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse37 v_arrayElimCell_53)))))) (.cse20 (= |c_ULTIMATE.start_node_create_#res#1.base| .cse8))) (let ((.cse10 (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_55 Int)) (let ((.cse35 (select (store (let ((.cse36 (store |c_#memory_int#1| .cse5 v_ArrVal_1417))) (store .cse36 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse36 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_ArrVal_1423) .cse4 v_ArrVal_1421))) .cse6 v_ArrVal_1426) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1413) .cse6 v_ArrVal_1424) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse35 v_arrayElimCell_55)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse35 |c_ULTIMATE.start_node_create_#res#1.offset|)))))) (.cse16 (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_53 Int) (v_arrayElimCell_55 Int)) (let ((.cse33 (select (store (let ((.cse34 (store |c_#memory_int#1| .cse5 v_ArrVal_1417))) (store .cse34 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse34 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_ArrVal_1423) .cse4 v_ArrVal_1421))) .cse6 v_ArrVal_1426) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1413) .cse6 v_ArrVal_1424) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse33 v_arrayElimCell_55)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse33 v_arrayElimCell_53)) (forall ((v_arrayElimCell_56 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse33 v_arrayElimCell_56))))))) (.cse17 (or .cse0 (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_53 Int) (v_arrayElimCell_56 Int)) (let ((.cse31 (select (store (let ((.cse32 (store |c_#memory_int#1| .cse5 v_ArrVal_1417))) (store .cse32 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse32 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_ArrVal_1423) .cse4 v_ArrVal_1421))) .cse6 v_ArrVal_1426) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1413) .cse6 v_ArrVal_1424) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 v_arrayElimCell_56)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 v_arrayElimCell_53))))))) (.cse18 (or (and (or (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_53 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse30 (store |c_#memory_int#1| .cse5 v_ArrVal_1417))) (store .cse30 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse30 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_ArrVal_1423) .cse4 v_ArrVal_1421))) .cse6 v_ArrVal_1426) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1413) .cse6 v_ArrVal_1424) .cse8) .cse9)) v_arrayElimCell_53))) .cse0) .cse29) .cse20)) (.cse19 (or .cse29 .cse11)) (.cse23 (not .cse20))) (and (or .cse0 (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_56 Int)) (let ((.cse1 (select (store (let ((.cse2 (store |c_#memory_int#1| .cse5 v_ArrVal_1417))) (store .cse2 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse2 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_ArrVal_1423) .cse4 v_ArrVal_1421))) .cse6 v_ArrVal_1426) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1413) .cse6 v_ArrVal_1424) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse1 v_arrayElimCell_56)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse1 |c_ULTIMATE.start_node_create_#res#1.offset|)))))) (or .cse10 .cse11) (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_55 Int)) (let ((.cse12 (select (store (let ((.cse13 (store |c_#memory_int#1| .cse5 v_ArrVal_1417))) (store .cse13 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse13 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_ArrVal_1423) .cse4 v_ArrVal_1421))) .cse6 v_ArrVal_1426) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1413) .cse6 v_ArrVal_1424) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 v_arrayElimCell_55)) (forall ((v_arrayElimCell_56 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 v_arrayElimCell_56))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 |c_ULTIMATE.start_node_create_#res#1.offset|))))) (or (= .cse14 .cse15) (and .cse16 .cse17 .cse18 .cse19)) (or .cse20 (and .cse10 (or (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse21 (store |c_#memory_int#1| .cse5 v_ArrVal_1417))) (store .cse21 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse21 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_ArrVal_1423) .cse4 v_ArrVal_1421))) .cse6 v_ArrVal_1426) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1413) .cse6 v_ArrVal_1424) .cse8) .cse9)) |c_ULTIMATE.start_node_create_#res#1.offset|))) .cse0))) (or (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse22 (store |c_#memory_int#1| .cse5 v_ArrVal_1417))) (store .cse22 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse22 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_ArrVal_1423) .cse4 v_ArrVal_1421))) .cse6 v_ArrVal_1426) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1413) .cse6 v_ArrVal_1424) .cse8) .cse9)) v_arrayElimCell_55))) .cse11) (or (and .cse16 (or .cse23 (let ((.cse24 (select |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base|))) (and (or .cse0 (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_56 Int)) (= (select (select (store (store (store |c_#memory_int#1| .cse5 v_ArrVal_1417) |c_ULTIMATE.start_node_create_#res#1.base| (store (store .cse24 .cse3 v_ArrVal_1423) .cse4 v_ArrVal_1421)) .cse6 v_ArrVal_1426) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1413) .cse6 v_ArrVal_1424) .cse8) .cse9)) v_arrayElimCell_56) |c_ULTIMATE.start_main_~uneq~0#1|))) (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_55 Int)) (let ((.cse25 (select (store (store (store |c_#memory_int#1| .cse5 v_ArrVal_1417) |c_ULTIMATE.start_node_create_#res#1.base| (store (store .cse24 .cse3 v_ArrVal_1423) .cse4 v_ArrVal_1421)) .cse6 v_ArrVal_1426) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1413) .cse6 v_ArrVal_1424) .cse8) .cse9)))) (or (forall ((v_arrayElimCell_56 Int)) (= (select .cse25 v_arrayElimCell_56) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 v_arrayElimCell_55)))))))) .cse17 .cse18 .cse19) (= .cse8 .cse5)) (or .cse23 (and (or (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_56 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse26 (store |c_#memory_int#1| .cse5 v_ArrVal_1417))) (store .cse26 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse26 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_ArrVal_1423) .cse4 v_ArrVal_1421))) .cse6 v_ArrVal_1426) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1413) .cse6 v_ArrVal_1424) .cse8) .cse9)) v_arrayElimCell_56))) .cse0) (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 Int) (v_ArrVal_1423 Int) (v_arrayElimCell_55 Int)) (let ((.cse27 (select (store (let ((.cse28 (store |c_#memory_int#1| .cse5 v_ArrVal_1417))) (store .cse28 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse28 |c_ULTIMATE.start_node_create_#res#1.base|) .cse3 v_ArrVal_1423) .cse4 v_ArrVal_1421))) .cse6 v_ArrVal_1426) (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1413) .cse6 v_ArrVal_1424) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 v_arrayElimCell_55)) (forall ((v_arrayElimCell_56 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 v_arrayElimCell_56))))))))))))))) is different from false [2025-03-08 04:33:56,371 INFO L349 Elim1Store]: treesize reduction 342, result has 40.1 percent of original size [2025-03-08 04:33:56,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 20715 treesize of output 19631 [2025-03-08 04:33:56,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:56,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1437 treesize of output 1369 [2025-03-08 04:33:56,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:56,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2365 treesize of output 2361 [2025-03-08 04:33:56,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:56,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2319 treesize of output 2311 [2025-03-08 04:33:56,798 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 04:33:56,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 79 [2025-03-08 04:33:56,818 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 04:33:56,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 469 treesize of output 1 [2025-03-08 04:33:57,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 583 treesize of output 577 [2025-03-08 04:33:57,723 INFO L349 Elim1Store]: treesize reduction 136, result has 51.8 percent of original size [2025-03-08 04:33:57,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 10278 treesize of output 9767 [2025-03-08 04:33:57,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:57,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 734 treesize of output 726 [2025-03-08 04:33:57,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1094 treesize of output 1088 [2025-03-08 04:33:57,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1088 treesize of output 1080 [2025-03-08 04:33:57,923 INFO L349 Elim1Store]: treesize reduction 278, result has 52.0 percent of original size [2025-03-08 04:33:57,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20875 treesize of output 19863 [2025-03-08 04:33:57,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:57,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1549 treesize of output 1481 [2025-03-08 04:33:57,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:57,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2627 treesize of output 2619 [2025-03-08 04:33:57,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:57,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2407 treesize of output 2399 [2025-03-08 04:33:58,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:58,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 469 treesize of output 473