./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_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/dll2n_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 93d1510274ba16ddd1276e8e93ff0a644bf6fb4a262c4c9dde32fe8591d5ce8c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:39:41,752 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:39:41,813 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:39:41,818 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:39:41,818 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:39:41,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:39:41,847 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:39:41,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:39:41,847 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:39:41,847 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:39:41,848 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:39:41,848 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:39:41,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:39:41,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:39:41,849 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:39:41,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:39:41,849 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:39:41,849 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:39:41,849 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:39:41,849 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:39:41,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:39:41,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:39:41,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:39:41,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:39:41,849 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:39:41,849 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:39:41,849 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:39:41,849 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:39:41,849 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:39:41,849 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:39:41,850 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:39:41,850 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:39:41,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:39:41,850 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:39:41,850 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:39:41,850 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:39:41,850 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:39:41,850 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:39:41,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:39:41,850 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:39:41,850 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:39:41,850 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:39:41,850 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:39:41,850 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 -> 93d1510274ba16ddd1276e8e93ff0a644bf6fb4a262c4c9dde32fe8591d5ce8c [2025-02-05 14:39:42,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:39:42,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:39:42,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:39:42,115 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:39:42,115 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:39:42,117 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_insert_equal.i [2025-02-05 14:39:43,354 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed3004ddb/321378f9178c479e8d02bddc26016d92/FLAGf6ff6d802 [2025-02-05 14:39:43,633 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:39:43,638 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_equal.i [2025-02-05 14:39:43,654 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed3004ddb/321378f9178c479e8d02bddc26016d92/FLAGf6ff6d802 [2025-02-05 14:39:43,674 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed3004ddb/321378f9178c479e8d02bddc26016d92 [2025-02-05 14:39:43,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:39:43,678 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:39:43,680 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:39:43,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:39:43,683 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:39:43,684 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:39:43" (1/1) ... [2025-02-05 14:39:43,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58251dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:39:43, skipping insertion in model container [2025-02-05 14:39:43,685 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:39:43" (1/1) ... [2025-02-05 14:39:43,715 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:39:43,908 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/dll2n_insert_equal.i[24706,24719] [2025-02-05 14:39:43,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:39:43,922 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:39:43,961 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/dll2n_insert_equal.i[24706,24719] [2025-02-05 14:39:43,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:39:43,978 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:39:43,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:39:43 WrapperNode [2025-02-05 14:39:43,979 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:39:43,980 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:39:43,980 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:39:43,980 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:39:43,984 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:43" (1/1) ... [2025-02-05 14:39:43,993 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:43" (1/1) ... [2025-02-05 14:39:44,010 INFO L138 Inliner]: procedures = 127, calls = 44, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 126 [2025-02-05 14:39:44,011 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:39:44,011 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:39:44,011 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:39:44,011 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:39:44,017 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:43" (1/1) ... [2025-02-05 14:39:44,017 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:43" (1/1) ... [2025-02-05 14:39:44,019 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:43" (1/1) ... [2025-02-05 14:39:44,031 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 8, 17]. 63 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 14 writes are split as follows [0, 1, 13]. [2025-02-05 14:39:44,032 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:43" (1/1) ... [2025-02-05 14:39:44,032 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:43" (1/1) ... [2025-02-05 14:39:44,042 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:43" (1/1) ... [2025-02-05 14:39:44,044 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:43" (1/1) ... [2025-02-05 14:39:44,045 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:43" (1/1) ... [2025-02-05 14:39:44,047 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:43" (1/1) ... [2025-02-05 14:39:44,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:39:44,050 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:39:44,050 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:39:44,050 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:39:44,051 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:39:43" (1/1) ... [2025-02-05 14:39:44,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:39:44,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:39:44,080 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:44,086 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:44,102 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-02-05 14:39:44,102 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-02-05 14:39:44,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 14:39:44,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 14:39:44,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 14:39:44,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 14:39:44,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 14:39:44,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 14:39:44,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-05 14:39:44,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:39:44,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 14:39:44,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 14:39:44,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 14:39:44,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-05 14:39:44,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 14:39:44,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 14:39:44,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-05 14:39:44,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 14:39:44,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-05 14:39:44,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-05 14:39:44,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-05 14:39:44,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:39:44,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 14:39:44,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 14:39:44,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:39:44,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:39:44,198 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:39:44,199 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:39:44,216 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-02-05 14:39:44,405 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L637: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-02-05 14:39:44,417 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2025-02-05 14:39:44,419 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:39:44,425 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:39:44,425 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:39:44,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:39:44 BoogieIcfgContainer [2025-02-05 14:39:44,425 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:39:44,427 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:39:44,428 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:39:44,431 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:39:44,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:39:43" (1/3) ... [2025-02-05 14:39:44,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@667e152a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:39:44, skipping insertion in model container [2025-02-05 14:39:44,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:39:43" (2/3) ... [2025-02-05 14:39:44,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@667e152a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:39:44, skipping insertion in model container [2025-02-05 14:39:44,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:39:44" (3/3) ... [2025-02-05 14:39:44,433 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_insert_equal.i [2025-02-05 14:39:44,444 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:39:44,445 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_insert_equal.i that has 2 procedures, 32 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-05 14:39:44,483 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:39:44,492 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;@64798808, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:39:44,492 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 14:39:44,495 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 29 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:44,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-05 14:39:44,500 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:39:44,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:39:44,502 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:39:44,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:39:44,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1210620438, now seen corresponding path program 1 times [2025-02-05 14:39:44,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:39:44,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106650059] [2025-02-05 14:39:44,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:39:44,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:39:44,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-05 14:39:44,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 14:39:44,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:39:44,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:39:44,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:39:44,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:39:44,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106650059] [2025-02-05 14:39:44,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106650059] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:39:44,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:39:44,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:39:44,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917452830] [2025-02-05 14:39:44,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:39:44,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:39:44,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:39:44,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:39:44,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:39:44,843 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 29 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:44,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:39:44,867 INFO L93 Difference]: Finished difference Result 60 states and 82 transitions. [2025-02-05 14:39:44,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:39:44,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-05 14:39:44,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:39:44,872 INFO L225 Difference]: With dead ends: 60 [2025-02-05 14:39:44,872 INFO L226 Difference]: Without dead ends: 27 [2025-02-05 14:39:44,874 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:39:44,877 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:39:44,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 75 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:44,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-05 14:39:44,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2025-02-05 14:39:44,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:44,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2025-02-05 14:39:44,898 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 14 [2025-02-05 14:39:44,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:39:44,898 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2025-02-05 14:39:44,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:44,898 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2025-02-05 14:39:44,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 14:39:44,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:39:44,899 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:39:44,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 14:39:44,900 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:39:44,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:39:44,901 INFO L85 PathProgramCache]: Analyzing trace with hash -467890695, now seen corresponding path program 1 times [2025-02-05 14:39:44,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:39:44,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202628869] [2025-02-05 14:39:44,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:39:44,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:39:44,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 14:39:44,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 14:39:44,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:39:44,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:39:45,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:39:45,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:39:45,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202628869] [2025-02-05 14:39:45,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202628869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:39:45,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:39:45,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:39:45,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208170419] [2025-02-05 14:39:45,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:39:45,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:39:45,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:39:45,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:39:45,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:39:45,033 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:45,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:39:45,050 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2025-02-05 14:39:45,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:39:45,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-05 14:39:45,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:39:45,051 INFO L225 Difference]: With dead ends: 46 [2025-02-05 14:39:45,051 INFO L226 Difference]: Without dead ends: 26 [2025-02-05 14:39:45,052 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:39:45,052 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:39:45,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:39:45,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-05 14:39:45,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-02-05 14:39:45,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:45,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2025-02-05 14:39:45,056 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 19 [2025-02-05 14:39:45,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:39:45,056 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2025-02-05 14:39:45,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:45,056 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2025-02-05 14:39:45,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 14:39:45,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:39:45,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:39:45,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 14:39:45,057 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:39:45,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:39:45,058 INFO L85 PathProgramCache]: Analyzing trace with hash -973449320, now seen corresponding path program 1 times [2025-02-05 14:39:45,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:39:45,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104045942] [2025-02-05 14:39:45,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:39:45,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:39:45,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 14:39:45,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 14:39:45,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:39:45,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:39:45,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:39:45,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:39:45,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104045942] [2025-02-05 14:39:45,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104045942] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:39:45,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656606900] [2025-02-05 14:39:45,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:39:45,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:39:45,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:39:45,196 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:45,197 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:45,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 14:39:45,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 14:39:45,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:39:45,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:39:45,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 14:39:45,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:39:45,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:39:45,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:39:45,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:39:45,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656606900] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:39:45,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:39:45,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-02-05 14:39:45,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765731385] [2025-02-05 14:39:45,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:39:45,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:39:45,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:39:45,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:39:45,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:39:45,408 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:45,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:39:45,427 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2025-02-05 14:39:45,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:39:45,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-05 14:39:45,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:39:45,430 INFO L225 Difference]: With dead ends: 43 [2025-02-05 14:39:45,430 INFO L226 Difference]: Without dead ends: 28 [2025-02-05 14:39:45,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:39:45,431 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:39:45,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 71 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:39:45,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-05 14:39:45,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-02-05 14:39:45,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:45,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-02-05 14:39:45,437 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 19 [2025-02-05 14:39:45,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:39:45,437 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-02-05 14:39:45,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:45,437 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2025-02-05 14:39:45,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 14:39:45,438 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:39:45,438 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:45,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 14:39:45,638 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:39:45,638 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:39:45,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:39:45,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1005356789, now seen corresponding path program 1 times [2025-02-05 14:39:45,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:39:45,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322383049] [2025-02-05 14:39:45,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:39:45,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:39:45,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 14:39:45,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 14:39:45,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:39:45,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:39:45,726 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 14:39:45,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:39:45,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322383049] [2025-02-05 14:39:45,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322383049] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:39:45,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:39:45,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:39:45,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778262327] [2025-02-05 14:39:45,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:39:45,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:39:45,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:39:45,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:39:45,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:39:45,729 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:45,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:39:45,746 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2025-02-05 14:39:45,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:39:45,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-05 14:39:45,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:39:45,747 INFO L225 Difference]: With dead ends: 37 [2025-02-05 14:39:45,747 INFO L226 Difference]: Without dead ends: 30 [2025-02-05 14:39:45,747 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:39:45,748 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 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:45,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 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:45,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-05 14:39:45,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-02-05 14:39:45,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:45,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2025-02-05 14:39:45,751 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 24 [2025-02-05 14:39:45,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:39:45,751 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2025-02-05 14:39:45,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:45,751 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2025-02-05 14:39:45,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 14:39:45,752 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:39:45,752 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:45,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 14:39:45,752 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:39:45,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:39:45,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1755800264, now seen corresponding path program 1 times [2025-02-05 14:39:45,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:39:45,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510156691] [2025-02-05 14:39:45,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:39:45,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:39:45,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 14:39:45,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 14:39:45,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:39:45,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:39:47,292 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:39:47,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:39:47,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510156691] [2025-02-05 14:39:47,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510156691] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:39:47,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401496497] [2025-02-05 14:39:47,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:39:47,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:39:47,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:39:47,294 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:47,296 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:47,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 14:39:47,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 14:39:47,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:39:47,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:39:47,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 86 conjuncts are in the unsatisfiable core [2025-02-05 14:39:47,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:39:47,726 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:39:47,823 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-05 14:39:47,823 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:39:47,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-02-05 14:39:47,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2025-02-05 14:39:47,977 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-05 14:39:47,977 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 57 treesize of output 50 [2025-02-05 14:39:47,984 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:39:48,171 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-02-05 14:39:48,172 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:39:48,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 31 [2025-02-05 14:39:48,279 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:39:48,407 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 51 treesize of output 19 [2025-02-05 14:39:48,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 26 [2025-02-05 14:39:48,503 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:48,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-05 14:39:48,592 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:48,654 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:39:48,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:39:48,752 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_472 (Array Int Int)) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_474 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_471) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_472) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_474) (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|))) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 4))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse0 (select v_ArrVal_471 .cse0))) v_ArrVal_471)))) is different from false [2025-02-05 14:39:48,770 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_472 (Array Int Int)) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_474 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_471) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_472) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse0) v_ArrVal_474) (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|))) (not (= v_ArrVal_471 (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse0 (select v_ArrVal_471 .cse0))))))) is different from false [2025-02-05 14:39:48,782 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_472 (Array Int Int)) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_474 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| .cse0 v_ArrVal_471) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_472) (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse1) v_ArrVal_474) (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|))) (not (= v_ArrVal_471 (store (select |c_#memory_int#2| .cse0) .cse1 (select v_ArrVal_471 .cse1))))))) is different from false [2025-02-05 14:39:48,804 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_468 (Array Int Int)) (v_ArrVal_472 (Array Int Int)) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_474 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (or (not (= (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_468) .cse0) .cse1 (select v_ArrVal_471 .cse1)) v_ArrVal_471)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| .cse0 v_ArrVal_471) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_472) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_469) .cse0) .cse1) v_ArrVal_474) (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|)))))) is different from false [2025-02-05 14:39:48,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 64 [2025-02-05 14:39:48,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 48 [2025-02-05 14:39:49,040 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_468 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_11| Int) (v_ArrVal_472 (Array Int Int)) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_474 (Array Int Int)) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_464)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_471) |v_ULTIMATE.start_node_create_~temp~0#1.base_11| v_ArrVal_472) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_465) |v_ULTIMATE.start_node_create_~temp~0#1.base_11| v_ArrVal_469) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_474) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= v_ArrVal_471 (store (select (store .cse0 |v_ULTIMATE.start_node_create_~temp~0#1.base_11| v_ArrVal_468) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_471 .cse1)))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_11|) 0))))) is different from false [2025-02-05 14:39:49,056 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 381 treesize of output 379 [2025-02-05 14:39:49,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:39:49,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 94 [2025-02-05 14:39:49,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 330 treesize of output 294 [2025-02-05 14:39:49,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 66 [2025-02-05 14:39:49,113 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 132 treesize of output 124 [2025-02-05 14:39:49,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 108 [2025-02-05 14:39:49,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:39:49,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 77 [2025-02-05 14:39:49,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:39:49,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 82 [2025-02-05 14:39:49,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:39:49,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 59 [2025-02-05 14:39:49,185 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 53 treesize of output 49 [2025-02-05 14:39:49,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-02-05 14:39:49,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-02-05 14:39:49,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-02-05 14:39:49,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-02-05 14:39:49,294 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 23 treesize of output 17 [2025-02-05 14:39:49,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-02-05 14:39:49,532 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-02-05 14:39:49,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401496497] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:39:49,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:39:49,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 46 [2025-02-05 14:39:49,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166957048] [2025-02-05 14:39:49,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:39:49,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-02-05 14:39:49,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:39:49,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-02-05 14:39:49,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1481, Unknown=17, NotChecked=410, Total=2070 [2025-02-05 14:39:49,535 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 46 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 46 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:50,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:39:50,556 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2025-02-05 14:39:50,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 14:39:50,556 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 46 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-05 14:39:50,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:39:50,558 INFO L225 Difference]: With dead ends: 50 [2025-02-05 14:39:50,558 INFO L226 Difference]: Without dead ends: 48 [2025-02-05 14:39:50,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=262, Invalid=2093, Unknown=17, NotChecked=490, Total=2862 [2025-02-05 14:39:50,559 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 283 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 14:39:50,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 244 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 886 Invalid, 0 Unknown, 283 Unchecked, 0.7s Time] [2025-02-05 14:39:50,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-05 14:39:50,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2025-02-05 14:39:50,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:50,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2025-02-05 14:39:50,563 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 25 [2025-02-05 14:39:50,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:39:50,563 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2025-02-05 14:39:50,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 46 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:50,564 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2025-02-05 14:39:50,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 14:39:50,564 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:39:50,564 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:50,572 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:50,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:39:50,765 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:39:50,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:39:50,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1755799458, now seen corresponding path program 1 times [2025-02-05 14:39:50,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:39:50,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220594740] [2025-02-05 14:39:50,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:39:50,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:39:50,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 14:39:50,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 14:39:50,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:39:50,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:39:50,850 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 14:39:50,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:39:50,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220594740] [2025-02-05 14:39:50,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220594740] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:39:50,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:39:50,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 14:39:50,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315716306] [2025-02-05 14:39:50,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:39:50,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 14:39:50,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:39:50,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 14:39:50,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:39:50,852 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:50,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:39:50,915 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2025-02-05 14:39:50,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 14:39:50,916 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-05 14:39:50,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:39:50,916 INFO L225 Difference]: With dead ends: 71 [2025-02-05 14:39:50,916 INFO L226 Difference]: Without dead ends: 43 [2025-02-05 14:39:50,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 14:39:50,917 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 16 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:39:50,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 108 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:39:50,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-05 14:39:50,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2025-02-05 14:39:50,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:50,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2025-02-05 14:39:50,920 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 25 [2025-02-05 14:39:50,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:39:50,921 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2025-02-05 14:39:50,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:50,921 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2025-02-05 14:39:50,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 14:39:50,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:39:50,921 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:50,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 14:39:50,921 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:39:50,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:39:50,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1727968426, now seen corresponding path program 1 times [2025-02-05 14:39:50,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:39:50,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084331229] [2025-02-05 14:39:50,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:39:50,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:39:50,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 14:39:50,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 14:39:50,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:39:50,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:39:51,037 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:39:51,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:39:51,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084331229] [2025-02-05 14:39:51,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084331229] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:39:51,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033362918] [2025-02-05 14:39:51,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:39:51,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:39:51,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:39:51,039 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:51,041 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:51,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 14:39:51,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 14:39:51,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:39:51,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:39:51,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 14:39:51,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:39:51,186 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 14:39:51,186 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:39:51,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033362918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:39:51,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 14:39:51,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2025-02-05 14:39:51,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988338002] [2025-02-05 14:39:51,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:39:51,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:39:51,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:39:51,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:39:51,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:39:51,187 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:51,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:39:51,200 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2025-02-05 14:39:51,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:39:51,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-05 14:39:51,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:39:51,201 INFO L225 Difference]: With dead ends: 48 [2025-02-05 14:39:51,201 INFO L226 Difference]: Without dead ends: 39 [2025-02-05 14:39:51,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 14:39:51,201 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:39:51,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 49 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:39:51,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-05 14:39:51,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2025-02-05 14:39:51,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:51,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2025-02-05 14:39:51,208 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 25 [2025-02-05 14:39:51,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:39:51,208 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2025-02-05 14:39:51,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:51,208 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2025-02-05 14:39:51,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 14:39:51,208 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:39:51,209 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:39:51,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 14:39:51,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:39:51,409 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:39:51,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:39:51,410 INFO L85 PathProgramCache]: Analyzing trace with hash 750255787, now seen corresponding path program 2 times [2025-02-05 14:39:51,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:39:51,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803490809] [2025-02-05 14:39:51,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:39:51,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:39:51,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-05 14:39:51,438 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 14:39:51,438 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:39:51,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:39:51,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 14:39:51,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:39:51,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803490809] [2025-02-05 14:39:51,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803490809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:39:51,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:39:51,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 14:39:51,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409646790] [2025-02-05 14:39:51,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:39:51,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:39:51,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:39:51,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:39:51,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:39:51,512 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:51,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:39:51,530 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2025-02-05 14:39:51,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:39:51,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-05 14:39:51,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:39:51,531 INFO L225 Difference]: With dead ends: 47 [2025-02-05 14:39:51,531 INFO L226 Difference]: Without dead ends: 34 [2025-02-05 14:39:51,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:39:51,532 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 19 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:39:51,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 51 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:39:51,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-05 14:39:51,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2025-02-05 14:39:51,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:51,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2025-02-05 14:39:51,534 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 26 [2025-02-05 14:39:51,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:39:51,534 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2025-02-05 14:39:51,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:51,537 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2025-02-05 14:39:51,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 14:39:51,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:39:51,538 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:39:51,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 14:39:51,539 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:39:51,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:39:51,539 INFO L85 PathProgramCache]: Analyzing trace with hash 778087625, now seen corresponding path program 1 times [2025-02-05 14:39:51,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:39:51,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893797698] [2025-02-05 14:39:51,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:39:51,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:39:51,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 14:39:51,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 14:39:51,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:39:51,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:39:51,626 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 14:39:51,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:39:51,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893797698] [2025-02-05 14:39:51,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893797698] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:39:51,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573468552] [2025-02-05 14:39:51,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:39:51,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:39:51,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:39:51,629 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:39:51,631 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:39:51,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 14:39:51,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 14:39:51,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:39:51,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:39:51,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 14:39:51,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:39:51,768 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 14:39:51,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:39:51,809 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 14:39:51,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573468552] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:39:51,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:39:51,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-05 14:39:51,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318590665] [2025-02-05 14:39:51,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:39:51,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 14:39:51,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:39:51,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 14:39:51,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:39:51,810 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:51,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:39:51,870 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2025-02-05 14:39:51,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 14:39:51,870 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-05 14:39:51,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:39:51,871 INFO L225 Difference]: With dead ends: 39 [2025-02-05 14:39:51,871 INFO L226 Difference]: Without dead ends: 32 [2025-02-05 14:39:51,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-05 14:39:51,871 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:39:51,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 99 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:39:51,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-05 14:39:51,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-05 14:39:51,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:51,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2025-02-05 14:39:51,874 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 26 [2025-02-05 14:39:51,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:39:51,874 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-02-05 14:39:51,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:51,874 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2025-02-05 14:39:51,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 14:39:51,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:39:51,875 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:39:51,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 14:39:52,075 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,SelfDestructingSolverStorable8 [2025-02-05 14:39:52,076 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:39:52,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:39:52,076 INFO L85 PathProgramCache]: Analyzing trace with hash 806716776, now seen corresponding path program 1 times [2025-02-05 14:39:52,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:39:52,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993930948] [2025-02-05 14:39:52,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:39:52,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:39:52,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 14:39:52,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 14:39:52,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:39:52,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:39:52,231 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:39:52,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:39:52,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993930948] [2025-02-05 14:39:52,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993930948] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:39:52,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366261253] [2025-02-05 14:39:52,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:39:52,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:39:52,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:39:52,234 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:52,235 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:52,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 14:39:52,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 14:39:52,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:39:52,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:39:52,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 14:39:52,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:39:52,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-02-05 14:39:52,410 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:39:52,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:39:52,427 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:39:52,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366261253] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:39:52,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:39:52,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2025-02-05 14:39:52,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252803] [2025-02-05 14:39:52,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:39:52,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 14:39:52,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:39:52,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 14:39:52,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 14:39:52,429 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:52,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:39:52,521 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2025-02-05 14:39:52,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 14:39:52,521 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-05 14:39:52,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:39:52,521 INFO L225 Difference]: With dead ends: 37 [2025-02-05 14:39:52,522 INFO L226 Difference]: Without dead ends: 29 [2025-02-05 14:39:52,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-02-05 14:39:52,522 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 16 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:39:52,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 109 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:39:52,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-05 14:39:52,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-02-05 14:39:52,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:52,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2025-02-05 14:39:52,525 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 26 [2025-02-05 14:39:52,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:39:52,525 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2025-02-05 14:39:52,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:39:52,526 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2025-02-05 14:39:52,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 14:39:52,526 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:39:52,526 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:39:52,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 14:39:52,726 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,SelfDestructingSolverStorable9 [2025-02-05 14:39:52,727 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:39:52,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:39:52,727 INFO L85 PathProgramCache]: Analyzing trace with hash 598168249, now seen corresponding path program 1 times [2025-02-05 14:39:52,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:39:52,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954622186] [2025-02-05 14:39:52,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:39:52,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:39:52,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 14:39:52,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 14:39:52,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:39:52,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:39:53,675 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:39:53,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:39:53,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954622186] [2025-02-05 14:39:53,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954622186] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:39:53,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247525145] [2025-02-05 14:39:53,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:39:53,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:39:53,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:39:53,678 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:53,679 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:53,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 14:39:54,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 14:39:54,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:39:54,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:39:54,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 144 conjuncts are in the unsatisfiable core [2025-02-05 14:39:54,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:39:54,048 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:39:54,095 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:39:54,100 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 18 treesize of output 7 [2025-02-05 14:39:54,190 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-05 14:39:54,190 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:39:54,265 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:54,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2025-02-05 14:39:54,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 [2025-02-05 14:39:54,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-02-05 14:39:54,350 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-05 14:39:54,350 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 110 treesize of output 93 [2025-02-05 14:39:54,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2025-02-05 14:39:54,364 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 39 treesize of output 15 [2025-02-05 14:39:54,591 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-02-05 14:39:54,592 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:39:54,688 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 67 treesize of output 44 [2025-02-05 14:39:54,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 46 treesize of output 38 [2025-02-05 14:39:54,705 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 27 [2025-02-05 14:39:54,709 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 8 treesize of output 7 [2025-02-05 14:39:54,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 29 [2025-02-05 14:39:54,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2025-02-05 14:39:55,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 49 [2025-02-05 14:39:55,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 38 treesize of output 30 [2025-02-05 14:39:55,025 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 20 treesize of output 15 [2025-02-05 14:39:55,098 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 65 treesize of output 40 [2025-02-05 14:39:55,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:39:55,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2025-02-05 14:39:55,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:39:55,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2025-02-05 14:39:55,223 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 69 treesize of output 45 [2025-02-05 14:39:55,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 22 [2025-02-05 14:39:55,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:39:55,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-05 14:39:55,426 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:39:55,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:39:55,614 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1270 Int) (v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1265 (Array Int Int)) (v_ArrVal_1271 (Array Int Int))) (let ((.cse6 (+ |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 4))) (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse6 v_ArrVal_1270)))) (let ((.cse3 (store .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1271)) (.cse5 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 8))) (or (not (= (let ((.cse2 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4))) (store (let ((.cse1 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8))) (store (select .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1271 .cse1))) .cse2 (select v_ArrVal_1271 .cse2))) v_ArrVal_1271)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store .cse3 |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1278) (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1265))) (store .cse4 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse7) .cse8)) (select (select (let ((.cse9 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1269))) (store .cse9 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) .cse7) .cse8)))) (not (= (store (select .cse3 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse5 (select v_ArrVal_1278 .cse5)) v_ArrVal_1278))))))) is different from false [2025-02-05 14:39:55,677 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1270 Int) (|v_ULTIMATE.start_dll_insert_~last~0#1.offset_26| Int) (v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1265 (Array Int Int)) (v_ArrVal_1271 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse4 v_ArrVal_1270)))) (let ((.cse5 (store .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1271)) (.cse6 (select .cse9 .cse4)) (.cse7 (+ |v_ULTIMATE.start_dll_insert_~last~0#1.offset_26| 8)) (.cse3 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base|))) (or (not (= (let ((.cse2 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4))) (store (let ((.cse1 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8))) (store (select .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1271 .cse1))) .cse2 (select v_ArrVal_1271 .cse2))) v_ArrVal_1271)) (< |v_ULTIMATE.start_dll_insert_~last~0#1.offset_26| (select .cse3 .cse4)) (not (= v_ArrVal_1278 (store (select .cse5 .cse6) .cse7 (select v_ArrVal_1278 .cse7)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store .cse5 .cse6 v_ArrVal_1278) (select (select (let ((.cse8 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse9 .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1265))) (store .cse8 .cse6 (store (select .cse8 .cse6) .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse10) .cse11)) (select (select (let ((.cse12 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse3 .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1269))) (store .cse12 .cse6 (store (select .cse12 .cse6) .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) .cse10) .cse11))))))))) is different from false [2025-02-05 14:39:55,719 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1270 Int) (|v_ULTIMATE.start_dll_insert_~last~0#1.offset_26| Int) (v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1265 (Array Int Int)) (v_ArrVal_1271 (Array Int Int))) (let ((.cse6 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse4)) (.cse11 (store |c_#memory_int#2| .cse4 (store (select |c_#memory_int#2| .cse4) .cse6 v_ArrVal_1270)))) (let ((.cse0 (store .cse11 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1271)) (.cse1 (select .cse5 .cse6)) (.cse3 (+ |v_ULTIMATE.start_dll_insert_~last~0#1.offset_26| 8)) (.cse10 (select |c_#memory_$Pointer$#2.offset| .cse4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store .cse0 .cse1 v_ArrVal_1278) (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$#2.base| .cse4 (store .cse5 .cse6 |c_ULTIMATE.start_node_create_#res#1.base|)) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1265))) (store .cse2 .cse1 (store (select .cse2 .cse1) .cse3 |c_ULTIMATE.start_node_create_#res#1.base|))) .cse7) .cse8)) (select (select (let ((.cse9 (store (store |c_#memory_$Pointer$#2.offset| .cse4 (store .cse10 .cse6 |c_ULTIMATE.start_node_create_#res#1.offset|)) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1269))) (store .cse9 .cse1 (store (select .cse9 .cse1) .cse3 |c_ULTIMATE.start_node_create_#res#1.offset|))) .cse7) .cse8)))) (not (= v_ArrVal_1278 (store (select .cse0 .cse1) .cse3 (select v_ArrVal_1278 .cse3)))) (< |v_ULTIMATE.start_dll_insert_~last~0#1.offset_26| (select .cse10 .cse6)) (not (= (let ((.cse13 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (store (let ((.cse12 (+ 8 |c_ULTIMATE.start_node_create_#res#1.offset|))) (store (select .cse11 |c_ULTIMATE.start_node_create_#res#1.base|) .cse12 (select v_ArrVal_1271 .cse12))) .cse13 (select v_ArrVal_1271 .cse13))) v_ArrVal_1271))))))) is different from false [2025-02-05 14:39:55,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:39:55,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 408 treesize of output 402 [2025-02-05 14:39:55,791 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1270 Int) (v_arrayElimArr_7 (Array Int Int)) (|v_ULTIMATE.start_dll_insert_~last~0#1.offset_26| Int) (v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1265 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1260 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_7)) (.cse9 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse11 (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1260) .cse1)) (.cse2 (store (select .cse0 .cse1) .cse9 v_ArrVal_1270))) (let ((.cse5 (store (store |c_#memory_int#2| .cse1 .cse2) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1271)) (.cse6 (select .cse11 .cse9)) (.cse7 (+ |v_ULTIMATE.start_dll_insert_~last~0#1.offset_26| 8)) (.cse8 (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1264) .cse1))) (or (not (= v_ArrVal_1271 (let ((.cse4 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (store (let ((.cse3 (+ 8 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (store (select (store .cse0 .cse1 .cse2) |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse3 (select v_ArrVal_1271 .cse3))) .cse4 (select v_ArrVal_1271 .cse4))))) (not (= |c_ULTIMATE.start_node_create_~data#1| (select v_arrayElimArr_7 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (not (= (store (select .cse5 .cse6) .cse7 (select v_ArrVal_1278 .cse7)) v_ArrVal_1278)) (< |v_ULTIMATE.start_dll_insert_~last~0#1.offset_26| (select .cse8 .cse9)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store .cse5 .cse6 v_ArrVal_1278) (select (select (let ((.cse10 (store (store |c_#memory_$Pointer$#2.base| .cse1 (store .cse11 .cse9 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1265))) (store .cse10 .cse6 (store (select .cse10 .cse6) .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) .cse12) .cse13)) (select (select (let ((.cse14 (store (store |c_#memory_$Pointer$#2.offset| .cse1 (store .cse8 .cse9 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1269))) (store .cse14 .cse6 (store (select .cse14 .cse6) .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) .cse12) .cse13))))))))) is different from false [2025-02-05 14:39:55,889 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 416 treesize of output 320 [2025-02-05 14:39:55,894 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 324 treesize of output 256 [2025-02-05 14:39:57,492 INFO L349 Elim1Store]: treesize reduction 20, result has 64.3 percent of original size [2025-02-05 14:39:57,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 43947 treesize of output 34901 [2025-02-05 14:39:57,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:39:57,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32300 treesize of output 32048 [2025-02-05 14:39:58,058 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 8490 treesize of output 8150 [2025-02-05 14:39:58,112 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 8130 treesize of output 7954 [2025-02-05 14:39:58,166 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 9290 treesize of output 9226 [2025-02-05 14:39:58,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:39:58,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 9274 treesize of output 6870