./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2c_insert_equal.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:38:41,722 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:38:41,756 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 14:38:41,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:38:41,759 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:38:41,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:38:41,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:38:41,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:38:41,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:38:41,774 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:38:41,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:38:41,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:38:41,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:38:41,774 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:38:41,774 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:38:41,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:38:41,775 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:38:41,775 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:38:41,775 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:38:41,775 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:38:41,775 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:38:41,775 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:38:41,775 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:38:41,775 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:38:41,775 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:38:41,775 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:38:41,775 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:38:41,776 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:38:41,776 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:38:41,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:38:41,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:38:41,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:38:41,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:38:41,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:38:41,776 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:38:41,776 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:38:41,776 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:38:41,777 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:38:41,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:38:41,777 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:38:41,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:38:41,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:38:41,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:38:41,777 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-jdk21/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 -> 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 [2025-02-05 14:38:41,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:38:41,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:38:41,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:38:41,948 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:38:41,948 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:38:41,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2025-02-05 14:38:43,016 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7aecd390c/bd85c347efe94ec68b361fa51a750dd9/FLAGfa22aed8f [2025-02-05 14:38:43,393 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:38:43,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2025-02-05 14:38:43,409 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7aecd390c/bd85c347efe94ec68b361fa51a750dd9/FLAGfa22aed8f [2025-02-05 14:38:43,424 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7aecd390c/bd85c347efe94ec68b361fa51a750dd9 [2025-02-05 14:38:43,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:38:43,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:38:43,430 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:38:43,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:38:43,434 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:38:43,435 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:38:43" (1/1) ... [2025-02-05 14:38:43,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c38d0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:43, skipping insertion in model container [2025-02-05 14:38:43,436 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:38:43" (1/1) ... [2025-02-05 14:38:43,470 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:38:43,694 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2025-02-05 14:38:43,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:38:43,707 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:38:43,755 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2025-02-05 14:38:43,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:38:43,774 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:38:43,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:43 WrapperNode [2025-02-05 14:38:43,775 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:38:43,776 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:38:43,776 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:38:43,776 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:38:43,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:43" (1/1) ... [2025-02-05 14:38:43,791 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:43" (1/1) ... [2025-02-05 14:38:43,810 INFO L138 Inliner]: procedures = 127, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 146 [2025-02-05 14:38:43,812 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:38:43,813 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:38:43,813 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:38:43,813 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:38:43,820 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:43" (1/1) ... [2025-02-05 14:38:43,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:43" (1/1) ... [2025-02-05 14:38:43,829 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:43" (1/1) ... [2025-02-05 14:38:43,843 INFO L175 MemorySlicer]: Split 35 memory accesses to 3 slices as follows [2, 11, 22]. 63 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 18 writes are split as follows [0, 1, 17]. [2025-02-05 14:38:43,843 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:43" (1/1) ... [2025-02-05 14:38:43,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:43" (1/1) ... [2025-02-05 14:38:43,848 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:43" (1/1) ... [2025-02-05 14:38:43,849 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:43" (1/1) ... [2025-02-05 14:38:43,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:43" (1/1) ... [2025-02-05 14:38:43,850 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:43" (1/1) ... [2025-02-05 14:38:43,852 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:38:43,852 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:38:43,853 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:38:43,853 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:38:43,853 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:43" (1/1) ... [2025-02-05 14:38:43,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:38:43,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:38:43,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 14:38:43,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 14:38:43,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 14:38:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 14:38:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 14:38:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 14:38:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 14:38:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 14:38:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-02-05 14:38:43,902 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-02-05 14:38:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-05 14:38:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:38:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 14:38:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 14:38:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 14:38:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-05 14:38:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 14:38:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 14:38:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-05 14:38:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 14:38:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-05 14:38:43,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-05 14:38:43,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-05 14:38:43,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:38:43,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 14:38:43,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 14:38:43,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:38:43,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:38:44,011 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:38:44,012 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:38:44,177 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L642: 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-02-05 14:38:44,195 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-02-05 14:38:44,219 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-02-05 14:38:44,219 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:38:44,224 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:38:44,224 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:38:44,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:38:44 BoogieIcfgContainer [2025-02-05 14:38:44,225 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:38:44,227 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:38:44,227 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:38:44,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:38:44,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:38:43" (1/3) ... [2025-02-05 14:38:44,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48847b64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:38:44, skipping insertion in model container [2025-02-05 14:38:44,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:43" (2/3) ... [2025-02-05 14:38:44,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48847b64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:38:44, skipping insertion in model container [2025-02-05 14:38:44,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:38:44" (3/3) ... [2025-02-05 14:38:44,232 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2025-02-05 14:38:44,241 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:38:44,243 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_insert_equal.i that has 2 procedures, 35 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-05 14:38:44,288 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:38:44,299 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;@58561901, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:38:44,300 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 14:38:44,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 14:38:44,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 14:38:44,312 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:38:44,313 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-02-05 14:38:44,313 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:38:44,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:38:44,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1254138751, now seen corresponding path program 1 times [2025-02-05 14:38:44,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:38:44,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685321040] [2025-02-05 14:38:44,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:38:44,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:38:44,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 14:38:44,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 14:38:44,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:38:44,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:44,672 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 14:38:44,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:38:44,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685321040] [2025-02-05 14:38:44,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685321040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:38:44,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:38:44,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:38:44,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83329312] [2025-02-05 14:38:44,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:38:44,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:38:44,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:38:44,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:38:44,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:38:44,694 INFO L87 Difference]: Start difference. First operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:38:44,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:38:44,721 INFO L93 Difference]: Finished difference Result 66 states and 91 transitions. [2025-02-05 14:38:44,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:38:44,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2025-02-05 14:38:44,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:38:44,728 INFO L225 Difference]: With dead ends: 66 [2025-02-05 14:38:44,728 INFO L226 Difference]: Without dead ends: 33 [2025-02-05 14:38:44,731 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-02-05 14:38:44,734 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 4 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 83 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-02-05 14:38:44,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 83 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:38:44,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-05 14:38:44,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2025-02-05 14:38:44,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 14:38:44,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2025-02-05 14:38:44,762 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 24 [2025-02-05 14:38:44,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:38:44,762 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2025-02-05 14:38:44,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:38:44,763 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2025-02-05 14:38:44,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-05 14:38:44,765 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:38:44,765 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:38:44,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 14:38:44,766 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:38:44,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:38:44,766 INFO L85 PathProgramCache]: Analyzing trace with hash 453619774, now seen corresponding path program 1 times [2025-02-05 14:38:44,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:38:44,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400760796] [2025-02-05 14:38:44,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:38:44,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:38:44,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 14:38:44,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 14:38:44,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:38:44,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:44,880 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 14:38:44,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:38:44,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400760796] [2025-02-05 14:38:44,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400760796] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:38:44,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:38:44,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:38:44,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029613039] [2025-02-05 14:38:44,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:38:44,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:38:44,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:38:44,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:38:44,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:38:44,884 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 14:38:44,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:38:44,906 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2025-02-05 14:38:44,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:38:44,907 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2025-02-05 14:38:44,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:38:44,908 INFO L225 Difference]: With dead ends: 38 [2025-02-05 14:38:44,908 INFO L226 Difference]: Without dead ends: 31 [2025-02-05 14:38:44,908 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-02-05 14:38:44,910 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 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-02-05 14:38:44,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:38:44,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-05 14:38:44,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-02-05 14:38:44,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 14:38:44,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2025-02-05 14:38:44,913 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 34 [2025-02-05 14:38:44,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:38:44,914 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2025-02-05 14:38:44,914 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 14:38:44,914 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2025-02-05 14:38:44,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-05 14:38:44,914 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:38:44,914 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:38:44,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 14:38:44,915 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:38:44,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:38:44,915 INFO L85 PathProgramCache]: Analyzing trace with hash 462568817, now seen corresponding path program 1 times [2025-02-05 14:38:44,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:38:44,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476570081] [2025-02-05 14:38:44,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:38:44,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:38:44,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 14:38:45,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 14:38:45,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:38:45,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:47,330 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:38:47,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:38:47,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476570081] [2025-02-05 14:38:47,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476570081] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:38:47,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670955765] [2025-02-05 14:38:47,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:38:47,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:38:47,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:38:47,335 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:38:47,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 14:38:47,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 14:38:47,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 14:38:47,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:38:47,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:47,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 160 conjuncts are in the unsatisfiable core [2025-02-05 14:38:47,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:38:48,020 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-02-05 14:38:48,037 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2025-02-05 14:38:48,284 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 14:38:48,381 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-05 14:38:48,381 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-02-05 14:38:48,391 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 16 treesize of output 11 [2025-02-05 14:38:48,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 14:38:48,464 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 23 treesize of output 11 [2025-02-05 14:38:48,475 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 16 treesize of output 11 [2025-02-05 14:38:48,556 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-05 14:38:48,556 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 68 treesize of output 59 [2025-02-05 14:38:48,561 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 11 treesize of output 3 [2025-02-05 14:38:48,565 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-02-05 14:38:48,740 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2025-02-05 14:38:48,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 115 [2025-02-05 14:38:48,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:38:48,750 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 28 treesize of output 25 [2025-02-05 14:38:48,753 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 18 treesize of output 11 [2025-02-05 14:38:48,763 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 18 [2025-02-05 14:38:48,766 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 17 [2025-02-05 14:38:48,922 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 30 treesize of output 14 [2025-02-05 14:38:48,929 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 15 treesize of output 7 [2025-02-05 14:38:48,948 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 11 treesize of output 3 [2025-02-05 14:38:49,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:38:49,163 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 38 treesize of output 27 [2025-02-05 14:38:49,176 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-02-05 14:38:49,176 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-02-05 14:38:49,185 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-02-05 14:38:49,362 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-02-05 14:38:49,469 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 39 treesize of output 15 [2025-02-05 14:38:49,473 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 25 treesize of output 15 [2025-02-05 14:38:49,531 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-02-05 14:38:49,616 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:38:49,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:38:49,704 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (v_ArrVal_389 (Array Int Int))) (or (not (= v_ArrVal_385 (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_385 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_385) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_389) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_388) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) is different from false [2025-02-05 14:38:49,722 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (v_ArrVal_389 (Array Int Int))) (or (not (= v_ArrVal_385 (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select v_ArrVal_385 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_385) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_389) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) v_ArrVal_388) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) is different from false [2025-02-05 14:38:49,734 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (v_ArrVal_389 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| .cse0 v_ArrVal_385) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_389) (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse1) v_ArrVal_388) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= (store (select |c_#memory_int#2| .cse0) .cse1 (select v_ArrVal_385 .cse1)) v_ArrVal_385))))) is different from false [2025-02-05 14:38:49,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670955765] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:38:49,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 14:38:49,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 47 [2025-02-05 14:38:49,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765553578] [2025-02-05 14:38:49,881 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 14:38:49,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-02-05 14:38:49,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:38:49,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-02-05 14:38:49,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2293, Unknown=3, NotChecked=294, Total=2756 [2025-02-05 14:38:49,887 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 47 states, 43 states have (on average 1.255813953488372) internal successors, (54), 37 states have internal predecessors, (54), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 14:38:51,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:38:51,772 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2025-02-05 14:38:51,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-05 14:38:51,772 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 1.255813953488372) internal successors, (54), 37 states have internal predecessors, (54), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 35 [2025-02-05 14:38:51,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:38:51,773 INFO L225 Difference]: With dead ends: 67 [2025-02-05 14:38:51,773 INFO L226 Difference]: Without dead ends: 65 [2025-02-05 14:38:51,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=315, Invalid=4250, Unknown=3, NotChecked=402, Total=4970 [2025-02-05 14:38:51,776 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 56 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 14:38:51,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 406 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 14:38:51,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-05 14:38:51,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2025-02-05 14:38:51,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 14:38:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2025-02-05 14:38:51,782 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 35 [2025-02-05 14:38:51,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:38:51,782 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2025-02-05 14:38:51,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 1.255813953488372) internal successors, (54), 37 states have internal predecessors, (54), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 14:38:51,782 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2025-02-05 14:38:51,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 14:38:51,783 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:38:51,783 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:38:51,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 14:38:51,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:38:51,988 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:38:51,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:38:51,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1481702721, now seen corresponding path program 1 times [2025-02-05 14:38:51,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:38:51,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040347775] [2025-02-05 14:38:51,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:38:51,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:38:52,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 14:38:52,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 14:38:52,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:38:52,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:52,219 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 14:38:52,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:38:52,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040347775] [2025-02-05 14:38:52,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040347775] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:38:52,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733986434] [2025-02-05 14:38:52,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:38:52,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:38:52,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:38:52,222 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:38:52,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 14:38:52,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 14:38:52,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 14:38:52,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:38:52,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:52,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 14:38:52,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:38:52,403 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 14:38:52,404 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:38:52,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733986434] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:38:52,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 14:38:52,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2025-02-05 14:38:52,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60496212] [2025-02-05 14:38:52,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:38:52,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:38:52,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:38:52,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:38:52,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:38:52,406 INFO L87 Difference]: Start difference. First operand 50 states and 65 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 14:38:52,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:38:52,425 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2025-02-05 14:38:52,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:38:52,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2025-02-05 14:38:52,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:38:52,426 INFO L225 Difference]: With dead ends: 61 [2025-02-05 14:38:52,426 INFO L226 Difference]: Without dead ends: 51 [2025-02-05 14:38:52,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 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-02-05 14:38:52,427 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 18 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:38:52,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 71 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:38:52,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-05 14:38:52,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2025-02-05 14:38:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 14:38:52,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2025-02-05 14:38:52,440 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 36 [2025-02-05 14:38:52,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:38:52,441 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2025-02-05 14:38:52,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 14:38:52,441 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2025-02-05 14:38:52,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 14:38:52,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:38:52,441 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:38:52,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 14:38:52,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:38:52,647 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:38:52,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:38:52,647 INFO L85 PathProgramCache]: Analyzing trace with hash 739989150, now seen corresponding path program 2 times [2025-02-05 14:38:52,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:38:52,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258638184] [2025-02-05 14:38:52,648 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:38:52,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:38:52,680 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-05 14:38:52,706 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 14:38:52,706 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:38:52,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:52,849 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 14:38:52,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:38:52,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258638184] [2025-02-05 14:38:52,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258638184] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:38:52,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355640330] [2025-02-05 14:38:52,849 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:38:52,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:38:52,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:38:52,854 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:38:52,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 14:38:52,970 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-05 14:38:53,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 14:38:53,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:38:53,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:53,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 14:38:53,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:38:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 14:38:53,104 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:38:53,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355640330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:38:53,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 14:38:53,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2025-02-05 14:38:53,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336001454] [2025-02-05 14:38:53,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:38:53,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:38:53,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:38:53,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:38:53,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 14:38:53,106 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 14:38:53,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:38:53,129 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2025-02-05 14:38:53,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:38:53,130 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2025-02-05 14:38:53,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:38:53,130 INFO L225 Difference]: With dead ends: 62 [2025-02-05 14:38:53,131 INFO L226 Difference]: Without dead ends: 51 [2025-02-05 14:38:53,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 14:38:53,131 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 17 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:38:53,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 73 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:38:53,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-05 14:38:53,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2025-02-05 14:38:53,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 41 states have internal predecessors, (50), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 14:38:53,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2025-02-05 14:38:53,137 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 36 [2025-02-05 14:38:53,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:38:53,137 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2025-02-05 14:38:53,137 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 14:38:53,138 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2025-02-05 14:38:53,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 14:38:53,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:38:53,138 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:38:53,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 14:38:53,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:38:53,339 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:38:53,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:38:53,340 INFO L85 PathProgramCache]: Analyzing trace with hash 2147074131, now seen corresponding path program 1 times [2025-02-05 14:38:53,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:38:53,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476875332] [2025-02-05 14:38:53,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:38:53,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:38:53,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 14:38:53,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 14:38:53,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:38:53,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:53,918 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:38:53,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:38:53,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476875332] [2025-02-05 14:38:53,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476875332] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:38:53,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588824848] [2025-02-05 14:38:53,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:38:53,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:38:53,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:38:53,924 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:38:53,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 14:38:54,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 14:38:54,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 14:38:54,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:38:54,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:54,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-02-05 14:38:54,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:38:54,085 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-02-05 14:38:54,195 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-05 14:38:54,196 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-02-05 14:38:54,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 14:38:54,280 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 16 treesize of output 11 [2025-02-05 14:38:54,355 INFO L349 Elim1Store]: treesize reduction 50, result has 18.0 percent of original size [2025-02-05 14:38:54,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 98 [2025-02-05 14:38:54,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 55 [2025-02-05 14:38:54,366 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 30 [2025-02-05 14:38:54,426 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 38 treesize of output 14 [2025-02-05 14:38:54,432 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 15 treesize of output 7 [2025-02-05 14:38:54,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:38:54,511 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 46 treesize of output 35 [2025-02-05 14:38:54,523 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-02-05 14:38:54,523 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 32 treesize of output 34 [2025-02-05 14:38:54,625 INFO L349 Elim1Store]: treesize reduction 37, result has 45.6 percent of original size [2025-02-05 14:38:54,626 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 1 case distinctions, treesize of input 97 treesize of output 80 [2025-02-05 14:38:54,671 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 53 treesize of output 44 [2025-02-05 14:38:54,686 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 53 treesize of output 44 [2025-02-05 14:38:54,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:38:54,749 INFO L349 Elim1Store]: treesize reduction 239, result has 19.5 percent of original size [2025-02-05 14:38:54,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 79 [2025-02-05 14:38:54,876 INFO L349 Elim1Store]: treesize reduction 114, result has 40.6 percent of original size [2025-02-05 14:38:54,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 144 [2025-02-05 14:38:54,925 INFO L349 Elim1Store]: treesize reduction 94, result has 36.9 percent of original size [2025-02-05 14:38:54,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 174 treesize of output 194 [2025-02-05 14:38:54,982 INFO L349 Elim1Store]: treesize reduction 173, result has 30.0 percent of original size [2025-02-05 14:38:54,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 209 [2025-02-05 14:38:55,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 [2025-02-05 14:38:55,264 INFO L349 Elim1Store]: treesize reduction 27, result has 46.0 percent of original size [2025-02-05 14:38:55,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 41 treesize of output 51 [2025-02-05 14:38:55,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:55,467 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 64 treesize of output 56 [2025-02-05 14:38:55,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:38:55,514 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 58 treesize of output 50 [2025-02-05 14:38:55,563 INFO L349 Elim1Store]: treesize reduction 50, result has 47.4 percent of original size [2025-02-05 14:38:55,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 95 [2025-02-05 14:38:55,645 INFO L349 Elim1Store]: treesize reduction 54, result has 43.2 percent of original size [2025-02-05 14:38:55,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 94 [2025-02-05 14:38:55,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-05 14:38:55,829 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-02-05 14:38:55,829 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 1 case distinctions, treesize of input 22 treesize of output 28 [2025-02-05 14:38:55,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-05 14:38:56,418 INFO L349 Elim1Store]: treesize reduction 200, result has 57.4 percent of original size [2025-02-05 14:38:56,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 27 case distinctions, treesize of input 111 treesize of output 368 [2025-02-05 14:39:03,756 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:39:03,807 INFO L349 Elim1Store]: treesize reduction 298, result has 8.9 percent of original size [2025-02-05 14:39:03,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 103 treesize of output 84 [2025-02-05 14:39:04,464 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:39:04,479 INFO L349 Elim1Store]: treesize reduction 209, result has 0.5 percent of original size [2025-02-05 14:39:04,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 96 treesize of output 1 [2025-02-05 14:39:06,143 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:39:06,154 INFO L349 Elim1Store]: treesize reduction 201, result has 0.5 percent of original size [2025-02-05 14:39:06,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 110 treesize of output 1 [2025-02-05 14:39:16,763 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-02-05 14:39:16,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 14:39:16,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-05 14:39:16,965 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Complicated and unsupported kind of self-update: (select |#memory_$Pointer$#2.base| (select v_arrayElimArr_8 v_prenex_113)) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.classify(DerPreprocessor.java:233) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.classify(DerPreprocessor.java:205) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:104) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:542) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:521) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:514) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:325) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-02-05 14:39:16,974 INFO L158 Benchmark]: Toolchain (without parser) took 33546.06ms. Allocated memory was 142.6MB in the beginning and 931.1MB in the end (delta: 788.5MB). Free memory was 111.9MB in the beginning and 398.9MB in the end (delta: -287.0MB). Peak memory consumption was 559.0MB. Max. memory is 16.1GB. [2025-02-05 14:39:16,974 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 226.5MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:39:16,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.54ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 93.6MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 14:39:16,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.62ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 91.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:39:16,975 INFO L158 Benchmark]: Boogie Preprocessor took 39.11ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 88.8MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 14:39:16,975 INFO L158 Benchmark]: IcfgBuilder took 372.53ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 69.1MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 14:39:16,976 INFO L158 Benchmark]: TraceAbstraction took 32746.96ms. Allocated memory was 142.6MB in the beginning and 931.1MB in the end (delta: 788.5MB). Free memory was 68.5MB in the beginning and 398.9MB in the end (delta: -330.4MB). Peak memory consumption was 517.1MB. Max. memory is 16.1GB. [2025-02-05 14:39:16,976 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 226.5MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.54ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 93.6MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.62ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 91.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.11ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 88.8MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 372.53ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 69.1MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 32746.96ms. Allocated memory was 142.6MB in the beginning and 931.1MB in the end (delta: 788.5MB). Free memory was 68.5MB in the beginning and 398.9MB in the end (delta: -330.4MB). Peak memory consumption was 517.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Complicated and unsupported kind of self-update: (select |#memory_$Pointer$#2.base| (select v_arrayElimArr_8 v_prenex_113)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Complicated and unsupported kind of self-update: (select |#memory_$Pointer$#2.base| (select v_arrayElimArr_8 v_prenex_113)): de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.classify(DerPreprocessor.java:233) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2025-02-05 14:39:17,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2c_insert_equal.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:39:19,228 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:39:19,323 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 14:39:19,327 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:39:19,328 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:39:19,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:39:19,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:39:19,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:39:19,349 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:39:19,349 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:39:19,349 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:39:19,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:39:19,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:39:19,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:39:19,350 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:39:19,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:39:19,351 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:39:19,351 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:39:19,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:39:19,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:39:19,351 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:39:19,351 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:39:19,351 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:39:19,351 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 14:39:19,351 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 14:39:19,351 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 14:39:19,351 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:39:19,351 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:39:19,351 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:39:19,351 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:39:19,351 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:39:19,351 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:39:19,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:39:19,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:39:19,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:39:19,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:39:19,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:39:19,352 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:39:19,352 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:39:19,352 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 14:39:19,352 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 14:39:19,352 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:39:19,352 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:39:19,352 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:39:19,352 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:39:19,352 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-jdk21/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 -> 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 [2025-02-05 14:39:19,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:39:19,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:39:19,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:39:19,598 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:39:19,599 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:39:19,601 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2025-02-05 14:39:20,838 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f1ef92ef/d891a3569681430b83294ac492f8428e/FLAGc278858e8 [2025-02-05 14:39:21,076 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:39:21,076 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2025-02-05 14:39:21,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f1ef92ef/d891a3569681430b83294ac492f8428e/FLAGc278858e8 [2025-02-05 14:39:21,422 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f1ef92ef/d891a3569681430b83294ac492f8428e [2025-02-05 14:39:21,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:39:21,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:39:21,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:39:21,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:39:21,430 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:39:21,431 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:39:21" (1/1) ... [2025-02-05 14:39:21,431 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@302bd6ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:39:21, skipping insertion in model container [2025-02-05 14:39:21,431 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:39:21" (1/1) ... [2025-02-05 14:39:21,462 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:39:21,646 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2025-02-05 14:39:21,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:39:21,659 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:39:21,710 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2025-02-05 14:39:21,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:39:21,739 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:39:21,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:39:21 WrapperNode [2025-02-05 14:39:21,740 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:39:21,741 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:39:21,741 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:39:21,741 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:39:21,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:39:21" (1/1) ... [2025-02-05 14:39:21,760 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:39:21" (1/1) ... [2025-02-05 14:39:21,773 INFO L138 Inliner]: procedures = 130, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 147 [2025-02-05 14:39:21,773 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:39:21,774 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:39:21,774 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:39:21,774 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:39:21,779 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:39:21" (1/1) ... [2025-02-05 14:39:21,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:39:21" (1/1) ... [2025-02-05 14:39:21,783 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:39:21" (1/1) ... [2025-02-05 14:39:21,813 INFO L175 MemorySlicer]: Split 35 memory accesses to 3 slices as follows [2, 22, 11]. 63 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 18 writes are split as follows [0, 17, 1]. [2025-02-05 14:39:21,813 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:39:21" (1/1) ... [2025-02-05 14:39:21,813 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:39:21" (1/1) ... [2025-02-05 14:39:21,829 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:39:21" (1/1) ... [2025-02-05 14:39:21,829 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:39:21" (1/1) ... [2025-02-05 14:39:21,831 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:39:21" (1/1) ... [2025-02-05 14:39:21,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:39:21" (1/1) ... [2025-02-05 14:39:21,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:39:21,838 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:39:21,838 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:39:21,838 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:39:21,842 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:39:21" (1/1) ... [2025-02-05 14:39:21,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:39:21,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:39:21,871 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 14:39:21,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 14:39:21,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-05 14:39:21,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-05 14:39:21,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-05 14:39:21,896 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-02-05 14:39:21,896 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-02-05 14:39:21,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-05 14:39:21,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:39:21,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 14:39:21,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 14:39:21,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 14:39:21,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-05 14:39:21,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 14:39:21,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 14:39:21,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-05 14:39:21,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 14:39:21,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-05 14:39:21,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-05 14:39:21,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-05 14:39:21,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-05 14:39:21,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-05 14:39:21,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-05 14:39:21,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 14:39:21,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-05 14:39:21,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-05 14:39:21,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:39:21,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:39:22,015 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:39:22,016 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:39:22,330 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L642: 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-02-05 14:39:22,379 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-02-05 14:39:22,398 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-02-05 14:39:22,398 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:39:22,406 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:39:22,406 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:39:22,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:39:22 BoogieIcfgContainer [2025-02-05 14:39:22,407 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:39:22,408 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:39:22,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:39:22,412 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:39:22,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:39:21" (1/3) ... [2025-02-05 14:39:22,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65eec4a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:39:22, skipping insertion in model container [2025-02-05 14:39:22,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:39:21" (2/3) ... [2025-02-05 14:39:22,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65eec4a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:39:22, skipping insertion in model container [2025-02-05 14:39:22,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:39:22" (3/3) ... [2025-02-05 14:39:22,413 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2025-02-05 14:39:22,423 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:39:22,424 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_insert_equal.i that has 2 procedures, 35 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-05 14:39:22,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:39:22,469 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;@70e0374e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:39:22,469 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 14:39:22,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 14:39:22,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 14:39:22,476 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:39:22,477 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-02-05 14:39:22,477 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:39:22,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:39:22,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1254138751, now seen corresponding path program 1 times [2025-02-05 14:39:22,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:39:22,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1499653879] [2025-02-05 14:39:22,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:39:22,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:39:22,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:39:22,508 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:39:22,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 14:39:22,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 14:39:22,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 14:39:22,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:39:22,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:39:22,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 14:39:22,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:39:22,750 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 14:39:22,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:39:22,751 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:39:22,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499653879] [2025-02-05 14:39:22,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499653879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:39:22,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:39:22,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:39:22,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069733606] [2025-02-05 14:39:22,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:39:22,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:39:22,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:39:22,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:39:22,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:39:22,770 INFO L87 Difference]: Start difference. First operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 14:39:22,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:39:22,931 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2025-02-05 14:39:22,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:39:22,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-02-05 14:39:22,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:39:22,936 INFO L225 Difference]: With dead ends: 50 [2025-02-05 14:39:22,936 INFO L226 Difference]: Without dead ends: 30 [2025-02-05 14:39:22,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-02-05 14:39:22,939 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:39:22,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:39:22,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-05 14:39:22,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-02-05 14:39:22,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 14:39:22,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2025-02-05 14:39:22,960 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 24 [2025-02-05 14:39:22,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:39:22,961 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2025-02-05 14:39:22,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 14:39:22,961 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2025-02-05 14:39:22,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 14:39:22,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:39:22,962 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-02-05 14:39:22,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 14:39:23,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:39:23,166 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:39:23,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:39:23,166 INFO L85 PathProgramCache]: Analyzing trace with hash -491146672, now seen corresponding path program 1 times [2025-02-05 14:39:23,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:39:23,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1324304254] [2025-02-05 14:39:23,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:39:23,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:39:23,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:39:23,169 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:39:23,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 14:39:23,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 14:39:23,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 14:39:23,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:39:23,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:39:23,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 14:39:23,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:39:23,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:39:23,326 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:39:23,326 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:39:23,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324304254] [2025-02-05 14:39:23,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324304254] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:39:23,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:39:23,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:39:23,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117740750] [2025-02-05 14:39:23,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:39:23,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:39:23,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:39:23,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:39:23,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:39:23,332 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:39:23,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:39:23,363 INFO L93 Difference]: Finished difference Result 56 states and 73 transitions. [2025-02-05 14:39:23,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:39:23,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2025-02-05 14:39:23,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:39:23,365 INFO L225 Difference]: With dead ends: 56 [2025-02-05 14:39:23,365 INFO L226 Difference]: Without dead ends: 35 [2025-02-05 14:39:23,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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-02-05 14:39:23,367 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 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-02-05 14:39:23,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 63 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:39:23,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-05 14:39:23,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2025-02-05 14:39:23,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 14:39:23,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2025-02-05 14:39:23,374 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 25 [2025-02-05 14:39:23,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:39:23,374 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2025-02-05 14:39:23,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:39:23,374 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2025-02-05 14:39:23,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-05 14:39:23,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:39:23,374 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:39:23,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 14:39:23,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:39:23,575 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:39:23,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:39:23,576 INFO L85 PathProgramCache]: Analyzing trace with hash 462568817, now seen corresponding path program 1 times [2025-02-05 14:39:23,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:39:23,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [988717114] [2025-02-05 14:39:23,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:39:23,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:39:23,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:39:23,578 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:39:23,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 14:39:23,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 14:39:23,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 14:39:23,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:39:23,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:39:23,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-02-05 14:39:23,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:39:23,770 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 7 [2025-02-05 14:39:23,945 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 14:39:24,048 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-02-05 14:39:24,049 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 19 treesize of output 27 [2025-02-05 14:39:24,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 14:39:24,130 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 23 treesize of output 11 [2025-02-05 14:39:24,189 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 16 treesize of output 11 [2025-02-05 14:39:24,198 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 16 treesize of output 11 [2025-02-05 14:39:24,363 INFO L349 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2025-02-05 14:39:24,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 113 [2025-02-05 14:39:24,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:39:24,375 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 28 treesize of output 25 [2025-02-05 14:39:24,387 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 78 treesize of output 60 [2025-02-05 14:39:24,409 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 18 treesize of output 11 [2025-02-05 14:39:24,605 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-05 14:39:24,605 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 64 [2025-02-05 14:39:24,612 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 27 treesize of output 19 [2025-02-05 14:39:24,621 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 19 treesize of output 11 [2025-02-05 14:39:24,833 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-05 14:39:24,833 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-02-05 14:39:24,845 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 5 treesize of output 3 [2025-02-05 14:39:24,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:39:24,870 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-02-05 14:39:24,871 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 2 case distinctions, treesize of input 129 treesize of output 78 [2025-02-05 14:39:24,897 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2025-02-05 14:39:24,898 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 32 treesize of output 34 [2025-02-05 14:39:25,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 19 [2025-02-05 14:39:25,288 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2025-02-05 14:39:25,294 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 25 treesize of output 15 [2025-02-05 14:39:25,353 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-02-05 14:39:25,401 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-02-05 14:39:25,440 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:39:25,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:39:30,075 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_250 (_ BitVec 32)) (v_ArrVal_251 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_260 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_10| (_ BitVec 32)) (v_ArrVal_249 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_10|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (store (store (store |c_#memory_int#1| .cse0 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_10| v_ArrVal_260) .cse0) .cse1 v_ArrVal_250)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_10| v_ArrVal_251) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_10| v_ArrVal_261) .cse0) .cse1) v_ArrVal_249)) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (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-02-05 14:39:30,080 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:39:30,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988717114] [2025-02-05 14:39:30,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988717114] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:39:30,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [379423039] [2025-02-05 14:39:30,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:39:30,080 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 14:39:30,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 14:39:30,096 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 14:39:30,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-02-05 14:39:30,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 14:39:30,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 14:39:30,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:39:30,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:39:30,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-02-05 14:39:30,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:39:30,529 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 7 [2025-02-05 14:39:30,738 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 14:39:30,795 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-02-05 14:39:30,795 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 19 treesize of output 27 [2025-02-05 14:39:30,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 14:39:30,934 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 23 treesize of output 11 [2025-02-05 14:39:31,042 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 16 treesize of output 11 [2025-02-05 14:39:31,055 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 16 treesize of output 11 [2025-02-05 14:39:31,321 INFO L349 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2025-02-05 14:39:31,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 113 [2025-02-05 14:39:31,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:39:31,341 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 28 treesize of output 25 [2025-02-05 14:39:31,353 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 80 treesize of output 64 [2025-02-05 14:39:31,376 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 18 treesize of output 11 [2025-02-05 14:39:31,719 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-05 14:39:31,720 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 97 [2025-02-05 14:39:31,726 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 21 treesize of output 11 [2025-02-05 14:39:31,731 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 11 treesize of output 3 [2025-02-05 14:39:31,734 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 18 treesize of output 12 [2025-02-05 14:39:36,073 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-05 14:39:36,073 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-02-05 14:39:36,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:39:36,101 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-02-05 14:39:36,101 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 2 case distinctions, treesize of input 180 treesize of output 111 [2025-02-05 14:39:36,128 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2025-02-05 14:39:36,128 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 32 treesize of output 34 [2025-02-05 14:39:36,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 19 [2025-02-05 14:39:36,649 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 64 treesize of output 26 [2025-02-05 14:39:36,659 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-02-05 14:39:36,760 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-02-05 14:39:36,887 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:39:36,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:39:37,127 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_250 (_ BitVec 32)) (v_ArrVal_251 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_384 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_385 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_14| (_ BitVec 32)) (v_ArrVal_249 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_14|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (store (store (store |c_#memory_int#1| .cse0 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_14| v_ArrVal_385) .cse0) .cse1 v_ArrVal_250)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_14| v_ArrVal_251) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_14| v_ArrVal_384) .cse0) .cse1) v_ArrVal_249)) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (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-02-05 14:39:37,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [379423039] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:39:37,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 14:39:37,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 43 [2025-02-05 14:39:37,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129133717] [2025-02-05 14:39:37,131 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 14:39:37,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-02-05 14:39:37,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:39:37,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-02-05 14:39:37,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2072, Unknown=36, NotChecked=186, Total=2450 [2025-02-05 14:39:37,134 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 43 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 34 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 14:39:43,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 14:39:53,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:39:53,954 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2025-02-05 14:39:53,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 14:39:53,955 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 34 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 35 [2025-02-05 14:39:53,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:39:53,957 INFO L225 Difference]: With dead ends: 65 [2025-02-05 14:39:53,957 INFO L226 Difference]: Without dead ends: 63 [2025-02-05 14:39:53,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=231, Invalid=3046, Unknown=37, NotChecked=226, Total=3540 [2025-02-05 14:39:53,958 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 50 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:39:53,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 318 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 755 Invalid, 2 Unknown, 0 Unchecked, 16.1s Time] [2025-02-05 14:39:53,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-05 14:39:53,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 50. [2025-02-05 14:39:53,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 14:39:53,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2025-02-05 14:39:53,967 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 35 [2025-02-05 14:39:53,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:39:53,968 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2025-02-05 14:39:53,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 34 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 14:39:53,968 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2025-02-05 14:39:53,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 14:39:53,970 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:39:53,970 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:39:53,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2025-02-05 14:39:54,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 14:39:54,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:39:54,372 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:39:54,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:39:54,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1481702721, now seen corresponding path program 1 times [2025-02-05 14:39:54,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:39:54,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2001120556] [2025-02-05 14:39:54,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:39:54,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:39:54,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:39:54,375 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:39:54,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 14:39:54,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 14:39:54,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 14:39:54,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:39:54,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:39:54,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 14:39:54,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:39:54,547 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 14:39:54,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:39:54,647 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 14:39:54,647 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:39:54,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001120556] [2025-02-05 14:39:54,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001120556] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 14:39:54,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 14:39:54,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 14:39:54,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184545006] [2025-02-05 14:39:54,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:39:54,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:39:54,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:39:54,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:39:54,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 14:39:54,648 INFO L87 Difference]: Start difference. First operand 50 states and 65 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 14:39:54,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:39:54,697 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2025-02-05 14:39:54,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:39:54,698 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), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2025-02-05 14:39:54,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:39:54,698 INFO L225 Difference]: With dead ends: 61 [2025-02-05 14:39:54,698 INFO L226 Difference]: Without dead ends: 51 [2025-02-05 14:39:54,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-05 14:39:54,699 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 37 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:39:54,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 71 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:39:54,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-05 14:39:54,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2025-02-05 14:39:54,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 14:39:54,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2025-02-05 14:39:54,704 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 36 [2025-02-05 14:39:54,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:39:54,704 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2025-02-05 14:39:54,704 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), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 14:39:54,704 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2025-02-05 14:39:54,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 14:39:54,705 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:39:54,705 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:39:54,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 14:39:54,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:39:54,906 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:39:54,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:39:54,906 INFO L85 PathProgramCache]: Analyzing trace with hash 739989150, now seen corresponding path program 2 times [2025-02-05 14:39:54,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:39:54,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [209750946] [2025-02-05 14:39:54,907 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:39:54,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:39:54,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:39:54,908 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:39:54,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 14:39:54,993 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-05 14:39:55,172 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 14:39:55,172 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:39:55,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:39:55,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 14:39:55,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:39:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 14:39:55,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:39:55,336 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 14:39:55,336 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:39:55,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209750946] [2025-02-05 14:39:55,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209750946] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:39:55,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 14:39:55,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-02-05 14:39:55,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893526818] [2025-02-05 14:39:55,337 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 14:39:55,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 14:39:55,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:39:55,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 14:39:55,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 14:39:55,338 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-05 14:39:55,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:39:55,389 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2025-02-05 14:39:55,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:39:55,390 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2025-02-05 14:39:55,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:39:55,391 INFO L225 Difference]: With dead ends: 62 [2025-02-05 14:39:55,391 INFO L226 Difference]: Without dead ends: 51 [2025-02-05 14:39:55,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 14:39:55,392 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 17 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:39:55,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 113 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:39:55,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-05 14:39:55,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2025-02-05 14:39:55,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 41 states have internal predecessors, (50), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 14:39:55,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2025-02-05 14:39:55,403 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 36 [2025-02-05 14:39:55,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:39:55,403 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2025-02-05 14:39:55,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-05 14:39:55,403 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2025-02-05 14:39:55,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 14:39:55,404 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:39:55,404 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:39:55,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 14:39:55,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:39:55,604 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:39:55,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:39:55,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2147074131, now seen corresponding path program 1 times [2025-02-05 14:39:55,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:39:55,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1272518056] [2025-02-05 14:39:55,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:39:55,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:39:55,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:39:55,615 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:39:55,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 14:39:55,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 14:39:55,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 14:39:55,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:39:55,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:39:55,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-05 14:39:55,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:39:55,752 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 7 [2025-02-05 14:39:55,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2025-02-05 14:39:55,923 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2025-02-05 14:39:55,923 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 17 treesize of output 17 [2025-02-05 14:39:57,704 INFO L349 Elim1Store]: treesize reduction 146, result has 31.8 percent of original size [2025-02-05 14:39:57,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 181 treesize of output 68 [2025-02-05 14:39:57,892 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 135 treesize of output 123 [2025-02-05 14:39:58,082 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 138 treesize of output 110 [2025-02-05 14:39:58,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:39:58,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 107 treesize of output 209 [2025-02-05 14:40:01,764 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:40:01,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:40:01,901 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 5582 treesize of output 5486 [2025-02-05 14:40:02,030 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-02-05 14:40:02,030 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 11 treesize of output 11 [2025-02-05 14:40:02,182 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:40:02,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272518056] [2025-02-05 14:40:02,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272518056] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:40:02,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [109615801] [2025-02-05 14:40:02,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:40:02,182 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 14:40:02,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 14:40:02,185 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 14:40:02,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-02-05 14:40:02,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 14:40:02,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 14:40:02,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:40:02,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:40:02,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-05 14:40:02,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:40:02,573 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 7 [2025-02-05 14:40:03,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2025-02-05 14:40:03,493 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2025-02-05 14:40:03,493 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 17 treesize of output 17 [2025-02-05 14:40:04,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 86 [2025-02-05 14:40:04,131 INFO L349 Elim1Store]: treesize reduction 130, result has 11.6 percent of original size [2025-02-05 14:40:04,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 184 treesize of output 153 [2025-02-05 14:40:04,206 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 134 treesize of output 118 [2025-02-05 14:40:06,167 INFO L349 Elim1Store]: treesize reduction 189, result has 16.0 percent of original size [2025-02-05 14:40:06,167 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 4 case distinctions, treesize of input 122 treesize of output 56 [2025-02-05 14:40:11,332 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-05 14:40:11,332 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 15 treesize of output 7