./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:15:17,138 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:15:17,188 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 12:15:17,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:15:17,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:15:17,216 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:15:17,217 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:15:17,217 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:15:17,217 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:15:17,217 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:15:17,218 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:15:17,218 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:15:17,218 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:15:17,218 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:15:17,219 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:15:17,219 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:15:17,219 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 12:15:17,219 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:15:17,219 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 12:15:17,219 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:15:17,219 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:15:17,220 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:15:17,220 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:15:17,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:15:17,220 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:15:17,220 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:15:17,220 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 12:15:17,220 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:15:17,220 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:15:17,220 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:15:17,220 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:15:17,220 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:15:17,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:15:17,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:15:17,221 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:15:17,221 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:15:17,221 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 12:15:17,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 12:15:17,221 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:15:17,221 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:15:17,221 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:15:17,221 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:15:17,221 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2025-03-17 12:15:17,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:15:17,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:15:17,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:15:17,467 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:15:17,467 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:15:17,468 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2025-03-17 12:15:18,625 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9576bca0/65c8cac8fbb24dd68267092b663786af/FLAGeb554a26b [2025-03-17 12:15:18,948 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:15:18,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2025-03-17 12:15:18,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9576bca0/65c8cac8fbb24dd68267092b663786af/FLAGeb554a26b [2025-03-17 12:15:19,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9576bca0/65c8cac8fbb24dd68267092b663786af [2025-03-17 12:15:19,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:15:19,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:15:19,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:15:19,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:15:19,193 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:15:19,194 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:15:19" (1/1) ... [2025-03-17 12:15:19,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2adabe3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:19, skipping insertion in model container [2025-03-17 12:15:19,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:15:19" (1/1) ... [2025-03-17 12:15:19,212 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:15:19,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:15:19,377 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:15:19,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:15:19,439 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:15:19,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:19 WrapperNode [2025-03-17 12:15:19,440 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:15:19,440 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:15:19,441 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:15:19,441 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:15:19,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:19" (1/1) ... [2025-03-17 12:15:19,458 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:19" (1/1) ... [2025-03-17 12:15:19,473 INFO L138 Inliner]: procedures = 127, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 184 [2025-03-17 12:15:19,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:15:19,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:15:19,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:15:19,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:15:19,479 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:19" (1/1) ... [2025-03-17 12:15:19,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:19" (1/1) ... [2025-03-17 12:15:19,483 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:19" (1/1) ... [2025-03-17 12:15:19,497 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 12, 26]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 18 writes are split as follows [0, 1, 17]. [2025-03-17 12:15:19,497 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:19" (1/1) ... [2025-03-17 12:15:19,498 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:19" (1/1) ... [2025-03-17 12:15:19,506 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:19" (1/1) ... [2025-03-17 12:15:19,509 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:19" (1/1) ... [2025-03-17 12:15:19,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:19" (1/1) ... [2025-03-17 12:15:19,511 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:19" (1/1) ... [2025-03-17 12:15:19,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:15:19,513 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:15:19,513 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:15:19,513 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:15:19,514 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:19" (1/1) ... [2025-03-17 12:15:19,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:15:19,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:19,535 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 12:15:19,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 12:15:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 12:15:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 12:15:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 12:15:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 12:15:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 12:15:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 12:15:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-17 12:15:19,556 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-17 12:15:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 12:15:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 12:15:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 12:15:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 12:15:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 12:15:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 12:15:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 12:15:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 12:15:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 12:15:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 12:15:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 12:15:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 12:15:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 12:15:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 12:15:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 12:15:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 12:15:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:15:19,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:15:19,677 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:15:19,679 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:15:20,108 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L642: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-03-17 12:15:20,133 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L578: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-17 12:15:20,162 INFO L? ?]: Removed 195 outVars from TransFormulas that were not future-live. [2025-03-17 12:15:20,163 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:15:20,176 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:15:20,176 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:15:20,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:15:20 BoogieIcfgContainer [2025-03-17 12:15:20,176 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:15:20,178 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:15:20,178 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:15:20,181 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:15:20,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:15:19" (1/3) ... [2025-03-17 12:15:20,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115ee00a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:15:20, skipping insertion in model container [2025-03-17 12:15:20,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:15:19" (2/3) ... [2025-03-17 12:15:20,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115ee00a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:15:20, skipping insertion in model container [2025-03-17 12:15:20,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:15:20" (3/3) ... [2025-03-17 12:15:20,184 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2025-03-17 12:15:20,194 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:15:20,195 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_insert_unequal.i that has 2 procedures, 175 locations, 1 initial locations, 5 loop locations, and 82 error locations. [2025-03-17 12:15:20,233 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:15:20,242 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=None, 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;@47ffcc8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:15:20,242 INFO L334 AbstractCegarLoop]: Starting to check reachability of 82 error locations. [2025-03-17 12:15:20,246 INFO L276 IsEmpty]: Start isEmpty. Operand has 175 states, 88 states have (on average 2.125) internal successors, (187), 170 states have internal predecessors, (187), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:15:20,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 12:15:20,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:20,249 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 12:15:20,250 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:20,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:20,253 INFO L85 PathProgramCache]: Analyzing trace with hash 201105095, now seen corresponding path program 1 times [2025-03-17 12:15:20,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:20,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942274033] [2025-03-17 12:15:20,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:20,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:20,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 12:15:20,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 12:15:20,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:20,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:20,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:15:20,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:20,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942274033] [2025-03-17 12:15:20,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942274033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:20,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:20,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:15:20,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204823583] [2025-03-17 12:15:20,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:20,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:15:20,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:20,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:15:20,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:15:20,493 INFO L87 Difference]: Start difference. First operand has 175 states, 88 states have (on average 2.125) internal successors, (187), 170 states have internal predecessors, (187), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:15:20,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:20,641 INFO L93 Difference]: Finished difference Result 171 states and 185 transitions. [2025-03-17 12:15:20,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:15:20,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 12:15:20,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:20,649 INFO L225 Difference]: With dead ends: 171 [2025-03-17 12:15:20,649 INFO L226 Difference]: Without dead ends: 168 [2025-03-17 12:15:20,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:15:20,655 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 3 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:20,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 275 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:15:20,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-17 12:15:20,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2025-03-17 12:15:20,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 85 states have (on average 2.0588235294117645) internal successors, (175), 163 states have internal predecessors, (175), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:15:20,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 181 transitions. [2025-03-17 12:15:20,694 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 181 transitions. Word has length 5 [2025-03-17 12:15:20,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:20,695 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 181 transitions. [2025-03-17 12:15:20,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:15:20,695 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 181 transitions. [2025-03-17 12:15:20,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 12:15:20,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:20,695 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 12:15:20,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 12:15:20,695 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:20,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:20,696 INFO L85 PathProgramCache]: Analyzing trace with hash 201105096, now seen corresponding path program 1 times [2025-03-17 12:15:20,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:20,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434578777] [2025-03-17 12:15:20,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:20,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:20,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 12:15:20,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 12:15:20,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:20,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:20,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:15:20,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:20,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434578777] [2025-03-17 12:15:20,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434578777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:20,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:20,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:15:20,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219225203] [2025-03-17 12:15:20,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:20,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:15:20,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:20,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:15:20,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:15:20,819 INFO L87 Difference]: Start difference. First operand 168 states and 181 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:15:20,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:20,934 INFO L93 Difference]: Finished difference Result 165 states and 178 transitions. [2025-03-17 12:15:20,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:15:20,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 12:15:20,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:20,936 INFO L225 Difference]: With dead ends: 165 [2025-03-17 12:15:20,937 INFO L226 Difference]: Without dead ends: 165 [2025-03-17 12:15:20,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:15:20,938 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 3 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:20,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 276 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:15:20,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-17 12:15:20,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-03-17 12:15:20,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 85 states have (on average 2.023529411764706) internal successors, (172), 160 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:15:20,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 178 transitions. [2025-03-17 12:15:20,950 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 178 transitions. Word has length 5 [2025-03-17 12:15:20,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:20,950 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 178 transitions. [2025-03-17 12:15:20,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:15:20,950 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 178 transitions. [2025-03-17 12:15:20,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 12:15:20,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:20,951 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:20,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 12:15:20,951 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:20,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:20,951 INFO L85 PathProgramCache]: Analyzing trace with hash -983239798, now seen corresponding path program 1 times [2025-03-17 12:15:20,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:20,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363866676] [2025-03-17 12:15:20,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:20,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:20,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 12:15:20,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 12:15:20,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:20,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:21,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:15:21,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:21,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363866676] [2025-03-17 12:15:21,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363866676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:21,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:21,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:15:21,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942008755] [2025-03-17 12:15:21,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:21,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:15:21,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:21,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:15:21,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:15:21,047 INFO L87 Difference]: Start difference. First operand 165 states and 178 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:15:21,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:21,057 INFO L93 Difference]: Finished difference Result 176 states and 191 transitions. [2025-03-17 12:15:21,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:15:21,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-03-17 12:15:21,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:21,058 INFO L225 Difference]: With dead ends: 176 [2025-03-17 12:15:21,058 INFO L226 Difference]: Without dead ends: 176 [2025-03-17 12:15:21,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:15:21,059 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 10 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:21,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 347 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:15:21,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-17 12:15:21,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 166. [2025-03-17 12:15:21,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 86 states have (on average 2.011627906976744) internal successors, (173), 161 states have internal predecessors, (173), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:15:21,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2025-03-17 12:15:21,070 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 13 [2025-03-17 12:15:21,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:21,070 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 179 transitions. [2025-03-17 12:15:21,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:15:21,071 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2025-03-17 12:15:21,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 12:15:21,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:21,071 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:21,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 12:15:21,071 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:21,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:21,072 INFO L85 PathProgramCache]: Analyzing trace with hash 522383919, now seen corresponding path program 1 times [2025-03-17 12:15:21,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:21,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571653723] [2025-03-17 12:15:21,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:21,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:21,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 12:15:21,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 12:15:21,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:21,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:21,227 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:15:21,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:21,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571653723] [2025-03-17 12:15:21,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571653723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:21,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:21,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:15:21,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304737607] [2025-03-17 12:15:21,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:21,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:15:21,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:21,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:15:21,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:15:21,228 INFO L87 Difference]: Start difference. First operand 166 states and 179 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:15:21,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:21,423 INFO L93 Difference]: Finished difference Result 165 states and 178 transitions. [2025-03-17 12:15:21,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:15:21,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-03-17 12:15:21,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:21,424 INFO L225 Difference]: With dead ends: 165 [2025-03-17 12:15:21,424 INFO L226 Difference]: Without dead ends: 165 [2025-03-17 12:15:21,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:15:21,425 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 7 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:21,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 524 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:15:21,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-17 12:15:21,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-03-17 12:15:21,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 86 states have (on average 2.0) internal successors, (172), 160 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:15:21,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 178 transitions. [2025-03-17 12:15:21,429 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 178 transitions. Word has length 23 [2025-03-17 12:15:21,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:21,430 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 178 transitions. [2025-03-17 12:15:21,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:15:21,430 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 178 transitions. [2025-03-17 12:15:21,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 12:15:21,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:21,430 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:21,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 12:15:21,430 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:21,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:21,431 INFO L85 PathProgramCache]: Analyzing trace with hash 522383920, now seen corresponding path program 1 times [2025-03-17 12:15:21,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:21,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310345802] [2025-03-17 12:15:21,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:21,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:21,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 12:15:21,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 12:15:21,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:21,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:21,627 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:15:21,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:21,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310345802] [2025-03-17 12:15:21,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310345802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:21,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:21,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:15:21,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455318203] [2025-03-17 12:15:21,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:21,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:15:21,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:21,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:15:21,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:15:21,629 INFO L87 Difference]: Start difference. First operand 165 states and 178 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:15:21,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:21,821 INFO L93 Difference]: Finished difference Result 164 states and 177 transitions. [2025-03-17 12:15:21,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:15:21,822 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-03-17 12:15:21,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:21,822 INFO L225 Difference]: With dead ends: 164 [2025-03-17 12:15:21,823 INFO L226 Difference]: Without dead ends: 164 [2025-03-17 12:15:21,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:15:21,824 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 9 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:21,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 616 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:15:21,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-17 12:15:21,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-03-17 12:15:21,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 86 states have (on average 1.9883720930232558) internal successors, (171), 159 states have internal predecessors, (171), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:15:21,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 177 transitions. [2025-03-17 12:15:21,835 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 177 transitions. Word has length 23 [2025-03-17 12:15:21,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:21,836 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 177 transitions. [2025-03-17 12:15:21,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:15:21,836 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 177 transitions. [2025-03-17 12:15:21,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 12:15:21,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:21,837 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:21,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 12:15:21,838 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:21,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:21,838 INFO L85 PathProgramCache]: Analyzing trace with hash -500223028, now seen corresponding path program 1 times [2025-03-17 12:15:21,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:21,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063872081] [2025-03-17 12:15:21,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:21,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:21,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:15:21,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:15:21,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:21,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:22,091 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:15:22,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:22,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063872081] [2025-03-17 12:15:22,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063872081] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:22,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672302218] [2025-03-17 12:15:22,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:22,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:22,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:22,096 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:15:22,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 12:15:22,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:15:22,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:15:22,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:22,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:22,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 12:15:22,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:22,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:15:22,263 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2025-03-17 12:15:22,294 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 12:15:22,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-17 12:15:22,309 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-03-17 12:15:22,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:15:22,484 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:15:22,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672302218] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:15:22,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:15:22,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 11 [2025-03-17 12:15:22,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274420637] [2025-03-17 12:15:22,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:15:22,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 12:15:22,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:22,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 12:15:22,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2025-03-17 12:15:22,490 INFO L87 Difference]: Start difference. First operand 164 states and 177 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 12:15:22,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:22,898 INFO L93 Difference]: Finished difference Result 169 states and 185 transitions. [2025-03-17 12:15:22,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:15:22,898 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2025-03-17 12:15:22,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:22,899 INFO L225 Difference]: With dead ends: 169 [2025-03-17 12:15:22,900 INFO L226 Difference]: Without dead ends: 169 [2025-03-17 12:15:22,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=101, Unknown=1, NotChecked=20, Total=156 [2025-03-17 12:15:22,900 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 2 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 178 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:22,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 845 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 698 Invalid, 0 Unknown, 178 Unchecked, 0.4s Time] [2025-03-17 12:15:22,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-17 12:15:22,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-03-17 12:15:22,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 90 states have (on average 1.9666666666666666) internal successors, (177), 163 states have internal predecessors, (177), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 12:15:22,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 185 transitions. [2025-03-17 12:15:22,907 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 185 transitions. Word has length 25 [2025-03-17 12:15:22,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:22,907 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 185 transitions. [2025-03-17 12:15:22,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 12:15:22,907 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 185 transitions. [2025-03-17 12:15:22,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 12:15:22,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:22,908 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:22,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 12:15:23,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 12:15:23,110 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:23,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:23,110 INFO L85 PathProgramCache]: Analyzing trace with hash -500223027, now seen corresponding path program 1 times [2025-03-17 12:15:23,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:23,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222701102] [2025-03-17 12:15:23,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:23,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:23,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:15:23,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:15:23,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:23,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:15:23,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:23,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222701102] [2025-03-17 12:15:23,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222701102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:23,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464352840] [2025-03-17 12:15:23,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:23,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:23,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:23,457 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:15:23,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 12:15:23,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:15:23,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:15:23,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:23,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:23,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 12:15:23,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:23,562 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 1 [2025-03-17 12:15:23,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:15:23,655 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-03-17 12:15:23,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:15:23,697 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 14 treesize of output 9 [2025-03-17 12:15:23,704 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:15:23,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:15:23,720 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-03-17 12:15:23,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:15:23,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464352840] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:23,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:15:23,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2025-03-17 12:15:23,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760232308] [2025-03-17 12:15:23,817 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:15:23,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 12:15:23,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:23,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 12:15:23,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=127, Unknown=1, NotChecked=22, Total=182 [2025-03-17 12:15:23,818 INFO L87 Difference]: Start difference. First operand 169 states and 185 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:15:24,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:24,335 INFO L93 Difference]: Finished difference Result 169 states and 184 transitions. [2025-03-17 12:15:24,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:15:24,336 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2025-03-17 12:15:24,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:24,337 INFO L225 Difference]: With dead ends: 169 [2025-03-17 12:15:24,337 INFO L226 Difference]: Without dead ends: 169 [2025-03-17 12:15:24,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=171, Unknown=1, NotChecked=26, Total=240 [2025-03-17 12:15:24,337 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:24,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 809 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 918 Invalid, 0 Unknown, 177 Unchecked, 0.5s Time] [2025-03-17 12:15:24,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-17 12:15:24,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-03-17 12:15:24,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 90 states have (on average 1.9555555555555555) internal successors, (176), 163 states have internal predecessors, (176), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 12:15:24,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 184 transitions. [2025-03-17 12:15:24,350 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 184 transitions. Word has length 25 [2025-03-17 12:15:24,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:24,350 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 184 transitions. [2025-03-17 12:15:24,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:15:24,350 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 184 transitions. [2025-03-17 12:15:24,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 12:15:24,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:24,350 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:24,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 12:15:24,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-17 12:15:24,551 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:24,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:24,552 INFO L85 PathProgramCache]: Analyzing trace with hash 322040763, now seen corresponding path program 1 times [2025-03-17 12:15:24,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:24,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137712394] [2025-03-17 12:15:24,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:24,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:24,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:15:24,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:15:24,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:24,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:24,638 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:15:24,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:24,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137712394] [2025-03-17 12:15:24,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137712394] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:24,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996297396] [2025-03-17 12:15:24,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:24,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:24,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:24,641 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:15:24,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 12:15:24,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:15:24,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:15:24,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:24,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:24,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 12:15:24,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:24,756 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:15:24,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:15:24,781 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:15:24,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996297396] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:15:24,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:15:24,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-17 12:15:24,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794132139] [2025-03-17 12:15:24,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:15:24,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:15:24,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:24,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:15:24,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:15:24,782 INFO L87 Difference]: Start difference. First operand 169 states and 184 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:15:24,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:24,820 INFO L93 Difference]: Finished difference Result 169 states and 183 transitions. [2025-03-17 12:15:24,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:15:24,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-03-17 12:15:24,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:24,821 INFO L225 Difference]: With dead ends: 169 [2025-03-17 12:15:24,821 INFO L226 Difference]: Without dead ends: 169 [2025-03-17 12:15:24,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:15:24,821 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 1 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:24,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 820 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:15:24,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-17 12:15:24,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-03-17 12:15:24,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 90 states have (on average 1.9444444444444444) internal successors, (175), 163 states have internal predecessors, (175), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 12:15:24,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 183 transitions. [2025-03-17 12:15:24,825 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 183 transitions. Word has length 27 [2025-03-17 12:15:24,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:24,825 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 183 transitions. [2025-03-17 12:15:24,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:15:24,826 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 183 transitions. [2025-03-17 12:15:24,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 12:15:24,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:24,830 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:24,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 12:15:25,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:25,030 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:25,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:25,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1392424396, now seen corresponding path program 1 times [2025-03-17 12:15:25,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:25,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092245605] [2025-03-17 12:15:25,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:25,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:25,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:15:25,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:15:25,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:25,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:25,107 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 12:15:25,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:25,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092245605] [2025-03-17 12:15:25,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092245605] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:25,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420593258] [2025-03-17 12:15:25,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:25,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:25,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:25,109 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:15:25,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 12:15:25,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:15:25,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:15:25,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:25,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:25,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 12:15:25,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:25,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:15:25,262 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-03-17 12:15:25,305 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 12:15:25,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-17 12:15:25,317 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2025-03-17 12:15:25,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:15:25,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420593258] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:25,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:15:25,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2025-03-17 12:15:25,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079309643] [2025-03-17 12:15:25,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:15:25,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 12:15:25,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:25,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 12:15:25,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2025-03-17 12:15:25,359 INFO L87 Difference]: Start difference. First operand 169 states and 183 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:15:25,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:25,640 INFO L93 Difference]: Finished difference Result 168 states and 182 transitions. [2025-03-17 12:15:25,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:15:25,641 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2025-03-17 12:15:25,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:25,642 INFO L225 Difference]: With dead ends: 168 [2025-03-17 12:15:25,642 INFO L226 Difference]: Without dead ends: 168 [2025-03-17 12:15:25,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2025-03-17 12:15:25,643 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 9 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:25,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 676 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 522 Invalid, 0 Unknown, 175 Unchecked, 0.2s Time] [2025-03-17 12:15:25,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-17 12:15:25,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2025-03-17 12:15:25,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 90 states have (on average 1.9333333333333333) internal successors, (174), 162 states have internal predecessors, (174), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 12:15:25,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2025-03-17 12:15:25,649 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 28 [2025-03-17 12:15:25,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:25,649 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2025-03-17 12:15:25,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:15:25,649 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2025-03-17 12:15:25,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 12:15:25,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:25,650 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:25,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 12:15:25,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:25,850 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:25,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:25,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1392424397, now seen corresponding path program 1 times [2025-03-17 12:15:25,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:25,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777255306] [2025-03-17 12:15:25,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:25,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:25,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:15:25,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:15:25,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:25,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:26,018 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:15:26,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:26,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777255306] [2025-03-17 12:15:26,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777255306] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:26,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133867403] [2025-03-17 12:15:26,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:26,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:26,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:26,021 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:15:26,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 12:15:26,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:15:26,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:15:26,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:26,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:26,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 12:15:26,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:26,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:15:26,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:15:26,227 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-03-17 12:15:26,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:15:26,252 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 14 treesize of output 9 [2025-03-17 12:15:26,257 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:15:26,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:15:26,285 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-03-17 12:15:26,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:15:26,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133867403] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:26,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:15:26,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2025-03-17 12:15:26,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928721380] [2025-03-17 12:15:26,380 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:15:26,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 12:15:26,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:26,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 12:15:26,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2025-03-17 12:15:26,381 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:15:26,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:26,752 INFO L93 Difference]: Finished difference Result 185 states and 204 transitions. [2025-03-17 12:15:26,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:15:26,752 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2025-03-17 12:15:26,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:26,754 INFO L225 Difference]: With dead ends: 185 [2025-03-17 12:15:26,754 INFO L226 Difference]: Without dead ends: 185 [2025-03-17 12:15:26,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=316, Unknown=1, NotChecked=36, Total=420 [2025-03-17 12:15:26,755 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 12 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 197 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:26,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1079 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 654 Invalid, 0 Unknown, 197 Unchecked, 0.3s Time] [2025-03-17 12:15:26,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-17 12:15:26,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 178. [2025-03-17 12:15:26,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 99 states have (on average 1.898989898989899) internal successors, (188), 171 states have internal predecessors, (188), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 12:15:26,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 198 transitions. [2025-03-17 12:15:26,758 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 198 transitions. Word has length 28 [2025-03-17 12:15:26,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:26,758 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 198 transitions. [2025-03-17 12:15:26,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:15:26,759 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 198 transitions. [2025-03-17 12:15:26,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 12:15:26,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:26,759 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:26,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 12:15:26,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 12:15:26,960 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:26,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:26,960 INFO L85 PathProgramCache]: Analyzing trace with hash 215483445, now seen corresponding path program 1 times [2025-03-17 12:15:26,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:26,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571918092] [2025-03-17 12:15:26,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:26,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:26,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 12:15:26,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:15:26,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:26,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:27,049 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:15:27,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:27,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571918092] [2025-03-17 12:15:27,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571918092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:27,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:27,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:15:27,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799276445] [2025-03-17 12:15:27,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:27,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:15:27,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:27,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:15:27,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:15:27,051 INFO L87 Difference]: Start difference. First operand 178 states and 198 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:15:27,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:27,255 INFO L93 Difference]: Finished difference Result 177 states and 197 transitions. [2025-03-17 12:15:27,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:15:27,255 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-03-17 12:15:27,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:27,256 INFO L225 Difference]: With dead ends: 177 [2025-03-17 12:15:27,256 INFO L226 Difference]: Without dead ends: 177 [2025-03-17 12:15:27,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:15:27,256 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 7 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:27,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 602 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:15:27,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-17 12:15:27,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2025-03-17 12:15:27,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 99 states have (on average 1.8888888888888888) internal successors, (187), 170 states have internal predecessors, (187), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 12:15:27,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 197 transitions. [2025-03-17 12:15:27,263 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 197 transitions. Word has length 29 [2025-03-17 12:15:27,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:27,264 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 197 transitions. [2025-03-17 12:15:27,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:15:27,264 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 197 transitions. [2025-03-17 12:15:27,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 12:15:27,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:27,264 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:27,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 12:15:27,265 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:27,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:27,265 INFO L85 PathProgramCache]: Analyzing trace with hash 215483446, now seen corresponding path program 1 times [2025-03-17 12:15:27,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:27,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070679265] [2025-03-17 12:15:27,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:27,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:27,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 12:15:27,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:15:27,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:27,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:27,409 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:15:27,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:27,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070679265] [2025-03-17 12:15:27,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070679265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:27,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:27,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:15:27,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200789121] [2025-03-17 12:15:27,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:27,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:15:27,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:27,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:15:27,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:15:27,412 INFO L87 Difference]: Start difference. First operand 177 states and 197 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:15:27,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:27,617 INFO L93 Difference]: Finished difference Result 176 states and 196 transitions. [2025-03-17 12:15:27,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:15:27,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-03-17 12:15:27,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:27,618 INFO L225 Difference]: With dead ends: 176 [2025-03-17 12:15:27,618 INFO L226 Difference]: Without dead ends: 176 [2025-03-17 12:15:27,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:15:27,619 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 6 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:27,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 627 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:15:27,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-17 12:15:27,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2025-03-17 12:15:27,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 99 states have (on average 1.878787878787879) internal successors, (186), 169 states have internal predecessors, (186), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 12:15:27,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 196 transitions. [2025-03-17 12:15:27,622 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 196 transitions. Word has length 29 [2025-03-17 12:15:27,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:27,623 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 196 transitions. [2025-03-17 12:15:27,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:15:27,623 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 196 transitions. [2025-03-17 12:15:27,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 12:15:27,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:27,623 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:27,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 12:15:27,624 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:27,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:27,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1694653682, now seen corresponding path program 1 times [2025-03-17 12:15:27,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:27,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562130744] [2025-03-17 12:15:27,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:27,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:27,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 12:15:27,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 12:15:27,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:27,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:27,686 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 12:15:27,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:27,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562130744] [2025-03-17 12:15:27,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562130744] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:27,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555123170] [2025-03-17 12:15:27,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:27,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:27,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:27,689 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:15:27,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 12:15:27,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 12:15:27,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 12:15:27,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:27,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:27,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 12:15:27,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:27,828 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 12:15:27,828 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:15:27,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555123170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:27,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:15:27,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-17 12:15:27,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234841130] [2025-03-17 12:15:27,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:27,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:15:27,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:27,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:15:27,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:15:27,830 INFO L87 Difference]: Start difference. First operand 176 states and 196 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:15:27,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:27,844 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2025-03-17 12:15:27,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 12:15:27,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2025-03-17 12:15:27,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:27,845 INFO L225 Difference]: With dead ends: 158 [2025-03-17 12:15:27,846 INFO L226 Difference]: Without dead ends: 158 [2025-03-17 12:15:27,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:15:27,847 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:27,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 485 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:15:27,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-17 12:15:27,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-03-17 12:15:27,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 86 states have (on average 1.8953488372093024) internal successors, (163), 153 states have internal predecessors, (163), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:15:27,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2025-03-17 12:15:27,852 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 40 [2025-03-17 12:15:27,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:27,852 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2025-03-17 12:15:27,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:15:27,852 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2025-03-17 12:15:27,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 12:15:27,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:27,854 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:27,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 12:15:28,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:28,055 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:28,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:28,055 INFO L85 PathProgramCache]: Analyzing trace with hash -528297735, now seen corresponding path program 1 times [2025-03-17 12:15:28,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:28,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332514841] [2025-03-17 12:15:28,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:28,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:28,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:15:28,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:15:28,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:28,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:28,402 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:15:28,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:28,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332514841] [2025-03-17 12:15:28,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332514841] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:28,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488061318] [2025-03-17 12:15:28,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:28,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:28,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:28,405 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:15:28,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 12:15:28,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:15:28,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:15:28,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:28,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:28,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 12:15:28,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:28,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:15:28,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:15:28,577 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:15:28,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 12:15:28,630 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 9 treesize of output 7 [2025-03-17 12:15:28,639 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2025-03-17 12:15:28,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:15:28,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 12:15:28,742 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2025-03-17 12:15:28,757 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 12:15:28,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-17 12:15:28,769 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 21 not checked. [2025-03-17 12:15:28,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:15:28,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488061318] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:28,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:15:28,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2025-03-17 12:15:28,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989861449] [2025-03-17 12:15:28,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:15:28,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 12:15:28,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:28,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 12:15:28,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=355, Unknown=2, NotChecked=78, Total=506 [2025-03-17 12:15:28,952 INFO L87 Difference]: Start difference. First operand 158 states and 169 transitions. Second operand has 20 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 17 states have internal predecessors, (64), 3 states have call successors, (4), 1 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 12:15:29,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:29,597 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2025-03-17 12:15:29,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 12:15:29,598 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 17 states have internal predecessors, (64), 3 states have call successors, (4), 1 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2025-03-17 12:15:29,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:29,599 INFO L225 Difference]: With dead ends: 166 [2025-03-17 12:15:29,599 INFO L226 Difference]: Without dead ends: 166 [2025-03-17 12:15:29,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=543, Unknown=2, NotChecked=98, Total=756 [2025-03-17 12:15:29,599 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 325 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 342 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:29,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 885 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1116 Invalid, 0 Unknown, 342 Unchecked, 0.5s Time] [2025-03-17 12:15:29,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-17 12:15:29,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 147. [2025-03-17 12:15:29,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 86 states have (on average 1.7674418604651163) internal successors, (152), 142 states have internal predecessors, (152), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:15:29,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2025-03-17 12:15:29,605 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 41 [2025-03-17 12:15:29,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:29,605 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2025-03-17 12:15:29,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 17 states have internal predecessors, (64), 3 states have call successors, (4), 1 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 12:15:29,606 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2025-03-17 12:15:29,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 12:15:29,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:29,606 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:29,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 12:15:29,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:29,807 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:29,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:29,807 INFO L85 PathProgramCache]: Analyzing trace with hash -528297734, now seen corresponding path program 1 times [2025-03-17 12:15:29,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:29,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508866194] [2025-03-17 12:15:29,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:29,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:29,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:15:29,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:15:29,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:29,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:30,213 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 12:15:30,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:30,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508866194] [2025-03-17 12:15:30,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508866194] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:30,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973144766] [2025-03-17 12:15:30,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:30,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:30,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:30,216 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:15:30,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 12:15:30,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:15:30,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:15:30,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:30,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:30,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 12:15:30,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:30,357 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 1 [2025-03-17 12:15:30,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:15:30,370 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2025-03-17 12:15:30,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:15:30,406 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 14 treesize of output 9 [2025-03-17 12:15:30,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:15:30,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:15:30,456 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 14 treesize of output 9 [2025-03-17 12:15:30,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:15:30,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:15:30,528 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 14 treesize of output 9 [2025-03-17 12:15:30,532 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-17 12:15:30,532 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:15:30,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973144766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:30,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:15:30,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-03-17 12:15:30,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820446946] [2025-03-17 12:15:30,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:30,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:15:30,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:30,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:15:30,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2025-03-17 12:15:30,533 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand has 7 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:15:30,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:30,672 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2025-03-17 12:15:30,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:15:30,672 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2025-03-17 12:15:30,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:30,673 INFO L225 Difference]: With dead ends: 141 [2025-03-17 12:15:30,673 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 12:15:30,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2025-03-17 12:15:30,673 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 52 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:30,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 335 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 220 Invalid, 0 Unknown, 184 Unchecked, 0.1s Time] [2025-03-17 12:15:30,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 12:15:30,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2025-03-17 12:15:30,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 86 states have (on average 1.686046511627907) internal successors, (145), 135 states have internal predecessors, (145), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:15:30,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 151 transitions. [2025-03-17 12:15:30,676 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 151 transitions. Word has length 41 [2025-03-17 12:15:30,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:30,676 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 151 transitions. [2025-03-17 12:15:30,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:15:30,676 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions. [2025-03-17 12:15:30,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 12:15:30,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:30,676 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:30,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 12:15:30,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 12:15:30,877 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:30,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:30,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1757529762, now seen corresponding path program 1 times [2025-03-17 12:15:30,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:30,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165067080] [2025-03-17 12:15:30,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:30,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:30,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:15:30,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:15:30,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:30,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:31,145 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:15:31,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:31,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165067080] [2025-03-17 12:15:31,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165067080] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:31,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567028103] [2025-03-17 12:15:31,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:31,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:31,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:31,148 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:15:31,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 12:15:31,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:15:31,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:15:31,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:31,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:31,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-17 12:15:31,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:31,694 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 7 treesize of output 3 [2025-03-17 12:15:31,733 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 9 treesize of output 3 [2025-03-17 12:15:31,738 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-03-17 12:15:31,778 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-03-17 12:15:31,778 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 23 treesize of output 24 [2025-03-17 12:15:31,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 12:15:31,789 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2025-03-17 12:15:31,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:15:31,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567028103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:31,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:15:31,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2025-03-17 12:15:31,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465439731] [2025-03-17 12:15:31,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:15:31,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 12:15:31,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:31,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 12:15:31,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=450, Unknown=1, NotChecked=42, Total=552 [2025-03-17 12:15:31,829 INFO L87 Difference]: Start difference. First operand 140 states and 151 transitions. Second operand has 23 states, 22 states have (on average 3.0) internal successors, (66), 20 states have internal predecessors, (66), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:15:32,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:32,432 INFO L93 Difference]: Finished difference Result 184 states and 200 transitions. [2025-03-17 12:15:32,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 12:15:32,432 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.0) internal successors, (66), 20 states have internal predecessors, (66), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 44 [2025-03-17 12:15:32,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:32,433 INFO L225 Difference]: With dead ends: 184 [2025-03-17 12:15:32,433 INFO L226 Difference]: Without dead ends: 184 [2025-03-17 12:15:32,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=825, Unknown=1, NotChecked=58, Total=992 [2025-03-17 12:15:32,434 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 383 mSDsluCounter, 1309 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:32,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1406 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1258 Invalid, 0 Unknown, 193 Unchecked, 0.5s Time] [2025-03-17 12:15:32,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-17 12:15:32,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 147. [2025-03-17 12:15:32,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 93 states have (on average 1.7419354838709677) internal successors, (162), 142 states have internal predecessors, (162), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:15:32,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 168 transitions. [2025-03-17 12:15:32,438 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 168 transitions. Word has length 44 [2025-03-17 12:15:32,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:32,438 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 168 transitions. [2025-03-17 12:15:32,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.0) internal successors, (66), 20 states have internal predecessors, (66), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:15:32,438 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 168 transitions. [2025-03-17 12:15:32,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 12:15:32,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:32,438 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:32,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 12:15:32,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 12:15:32,639 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:32,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:32,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1757529761, now seen corresponding path program 1 times [2025-03-17 12:15:32,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:32,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129505431] [2025-03-17 12:15:32,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:32,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:32,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:15:32,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:15:32,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:32,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:32,988 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:15:32,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:32,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129505431] [2025-03-17 12:15:32,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129505431] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:32,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132732856] [2025-03-17 12:15:32,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:32,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:32,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:32,991 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:15:32,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 12:15:33,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:15:33,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:15:33,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:33,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:33,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-17 12:15:33,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:33,197 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 1 [2025-03-17 12:15:33,377 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 9 treesize of output 3 [2025-03-17 12:15:33,379 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 9 treesize of output 3 [2025-03-17 12:15:33,406 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0))) is different from true [2025-03-17 12:15:33,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:15:33,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 12:15:33,451 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-17 12:15:33,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-17 12:15:33,486 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 17 treesize of output 9 [2025-03-17 12:15:33,526 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2025-03-17 12:15:33,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:15:33,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132732856] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:33,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:15:33,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 25 [2025-03-17 12:15:33,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992155133] [2025-03-17 12:15:33,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:15:33,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 12:15:33,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:33,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 12:15:33,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=736, Unknown=1, NotChecked=54, Total=870 [2025-03-17 12:15:33,670 INFO L87 Difference]: Start difference. First operand 147 states and 168 transitions. Second operand has 26 states, 24 states have (on average 2.875) internal successors, (69), 22 states have internal predecessors, (69), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:15:34,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:34,537 INFO L93 Difference]: Finished difference Result 192 states and 205 transitions. [2025-03-17 12:15:34,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 12:15:34,538 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.875) internal successors, (69), 22 states have internal predecessors, (69), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 44 [2025-03-17 12:15:34,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:34,538 INFO L225 Difference]: With dead ends: 192 [2025-03-17 12:15:34,538 INFO L226 Difference]: Without dead ends: 192 [2025-03-17 12:15:34,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=1558, Unknown=1, NotChecked=80, Total=1806 [2025-03-17 12:15:34,539 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 374 mSDsluCounter, 1444 mSDsCounter, 0 mSdLazyCounter, 1575 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 198 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:34,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1544 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1575 Invalid, 0 Unknown, 198 Unchecked, 0.6s Time] [2025-03-17 12:15:34,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-17 12:15:34,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 155. [2025-03-17 12:15:34,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 100 states have (on average 1.67) internal successors, (167), 149 states have internal predecessors, (167), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:15:34,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 173 transitions. [2025-03-17 12:15:34,543 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 173 transitions. Word has length 44 [2025-03-17 12:15:34,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:34,543 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 173 transitions. [2025-03-17 12:15:34,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.875) internal successors, (69), 22 states have internal predecessors, (69), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:15:34,544 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 173 transitions. [2025-03-17 12:15:34,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 12:15:34,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:34,544 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:34,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 12:15:34,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 12:15:34,749 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:34,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:34,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1351153163, now seen corresponding path program 1 times [2025-03-17 12:15:34,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:34,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99494866] [2025-03-17 12:15:34,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:34,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:34,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 12:15:34,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 12:15:34,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:34,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:34,798 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-17 12:15:34,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:34,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99494866] [2025-03-17 12:15:34,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99494866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:34,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:34,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:15:34,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459226752] [2025-03-17 12:15:34,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:34,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:15:34,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:34,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:15:34,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:15:34,800 INFO L87 Difference]: Start difference. First operand 155 states and 173 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 12:15:34,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:34,811 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2025-03-17 12:15:34,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:15:34,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2025-03-17 12:15:34,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:34,812 INFO L225 Difference]: With dead ends: 151 [2025-03-17 12:15:34,812 INFO L226 Difference]: Without dead ends: 151 [2025-03-17 12:15:34,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:15:34,812 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:34,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:15:34,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-17 12:15:34,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-03-17 12:15:34,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 96 states have (on average 1.625) internal successors, (156), 145 states have internal predecessors, (156), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:15:34,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2025-03-17 12:15:34,817 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 45 [2025-03-17 12:15:34,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:34,818 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2025-03-17 12:15:34,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 12:15:34,818 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2025-03-17 12:15:34,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 12:15:34,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:34,818 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:34,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 12:15:34,818 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:34,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:34,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1377281107, now seen corresponding path program 1 times [2025-03-17 12:15:34,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:34,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39980550] [2025-03-17 12:15:34,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:34,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:34,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 12:15:34,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 12:15:34,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:34,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:34,942 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-17 12:15:34,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:34,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39980550] [2025-03-17 12:15:34,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39980550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:34,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:34,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:15:34,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258205069] [2025-03-17 12:15:34,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:34,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:15:34,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:34,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:15:34,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:15:34,944 INFO L87 Difference]: Start difference. First operand 151 states and 162 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:15:34,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:34,962 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2025-03-17 12:15:34,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:15:34,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2025-03-17 12:15:34,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:34,963 INFO L225 Difference]: With dead ends: 152 [2025-03-17 12:15:34,963 INFO L226 Difference]: Without dead ends: 152 [2025-03-17 12:15:34,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:15:34,964 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 94 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:34,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 326 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:15:34,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-17 12:15:34,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 148. [2025-03-17 12:15:34,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 95 states have (on average 1.6) internal successors, (152), 142 states have internal predecessors, (152), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:15:34,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2025-03-17 12:15:34,966 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 47 [2025-03-17 12:15:34,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:34,966 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2025-03-17 12:15:34,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:15:34,967 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2025-03-17 12:15:34,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 12:15:34,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:34,967 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:34,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 12:15:34,967 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:34,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:34,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1378139921, now seen corresponding path program 1 times [2025-03-17 12:15:34,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:34,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248819461] [2025-03-17 12:15:34,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:34,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:34,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 12:15:34,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 12:15:34,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:34,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:35,039 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 12:15:35,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:35,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248819461] [2025-03-17 12:15:35,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248819461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:35,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:35,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:15:35,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846026542] [2025-03-17 12:15:35,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:35,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:15:35,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:35,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:15:35,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:15:35,041 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 12:15:35,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:35,158 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2025-03-17 12:15:35,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:15:35,158 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-03-17 12:15:35,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:35,159 INFO L225 Difference]: With dead ends: 142 [2025-03-17 12:15:35,159 INFO L226 Difference]: Without dead ends: 142 [2025-03-17 12:15:35,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:15:35,159 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 31 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:35,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 384 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:15:35,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-17 12:15:35,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-03-17 12:15:35,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 95 states have (on average 1.5368421052631578) internal successors, (146), 136 states have internal predecessors, (146), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:15:35,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 152 transitions. [2025-03-17 12:15:35,162 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 152 transitions. Word has length 47 [2025-03-17 12:15:35,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:35,162 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 152 transitions. [2025-03-17 12:15:35,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 12:15:35,162 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2025-03-17 12:15:35,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 12:15:35,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:35,162 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:35,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 12:15:35,162 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:35,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:35,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1378139922, now seen corresponding path program 1 times [2025-03-17 12:15:35,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:35,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216163640] [2025-03-17 12:15:35,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:35,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:35,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 12:15:35,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 12:15:35,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:35,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:35,236 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-17 12:15:35,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:35,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216163640] [2025-03-17 12:15:35,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216163640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:35,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:35,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:15:35,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544491264] [2025-03-17 12:15:35,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:35,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:15:35,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:35,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:15:35,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:15:35,238 INFO L87 Difference]: Start difference. First operand 142 states and 152 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:15:35,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:35,263 INFO L93 Difference]: Finished difference Result 145 states and 153 transitions. [2025-03-17 12:15:35,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 12:15:35,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2025-03-17 12:15:35,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:35,264 INFO L225 Difference]: With dead ends: 145 [2025-03-17 12:15:35,264 INFO L226 Difference]: Without dead ends: 145 [2025-03-17 12:15:35,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:15:35,264 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 90 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:35,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 311 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:15:35,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-17 12:15:35,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2025-03-17 12:15:35,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 94 states have (on average 1.5319148936170213) internal successors, (144), 135 states have internal predecessors, (144), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:15:35,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2025-03-17 12:15:35,267 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 47 [2025-03-17 12:15:35,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:35,267 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2025-03-17 12:15:35,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:15:35,267 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2025-03-17 12:15:35,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 12:15:35,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:35,268 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:35,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 12:15:35,268 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:35,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:35,268 INFO L85 PathProgramCache]: Analyzing trace with hash -253957706, now seen corresponding path program 1 times [2025-03-17 12:15:35,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:35,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83207764] [2025-03-17 12:15:35,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:35,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:35,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 12:15:35,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 12:15:35,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:35,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:35,316 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-17 12:15:35,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:35,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83207764] [2025-03-17 12:15:35,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83207764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:35,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:35,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:15:35,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108006310] [2025-03-17 12:15:35,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:35,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:15:35,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:35,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:15:35,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:15:35,318 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 12:15:35,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:35,396 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2025-03-17 12:15:35,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 12:15:35,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-03-17 12:15:35,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:35,397 INFO L225 Difference]: With dead ends: 140 [2025-03-17 12:15:35,397 INFO L226 Difference]: Without dead ends: 140 [2025-03-17 12:15:35,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:15:35,398 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 2 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:35,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 288 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:15:35,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-17 12:15:35,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-03-17 12:15:35,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 94 states have (on average 1.5212765957446808) internal successors, (143), 134 states have internal predecessors, (143), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:15:35,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2025-03-17 12:15:35,400 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 48 [2025-03-17 12:15:35,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:35,401 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2025-03-17 12:15:35,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 12:15:35,401 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2025-03-17 12:15:35,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 12:15:35,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:35,401 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:35,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 12:15:35,401 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:35,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:35,402 INFO L85 PathProgramCache]: Analyzing trace with hash -253957705, now seen corresponding path program 1 times [2025-03-17 12:15:35,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:35,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909381125] [2025-03-17 12:15:35,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:35,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:35,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 12:15:35,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 12:15:35,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:35,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:35,829 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:15:35,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:35,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909381125] [2025-03-17 12:15:35,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909381125] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:35,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919725297] [2025-03-17 12:15:35,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:35,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:35,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:35,831 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:15:35,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 12:15:35,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 12:15:36,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 12:15:36,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:36,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:36,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-17 12:15:36,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:36,094 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 7 treesize of output 3 [2025-03-17 12:15:36,137 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-17 12:15:36,137 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:15:36,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919725297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:36,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:15:36,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 20 [2025-03-17 12:15:36,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181355337] [2025-03-17 12:15:36,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:36,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:15:36,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:36,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:15:36,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2025-03-17 12:15:36,138 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:15:36,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:36,251 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2025-03-17 12:15:36,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:15:36,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2025-03-17 12:15:36,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:36,252 INFO L225 Difference]: With dead ends: 140 [2025-03-17 12:15:36,252 INFO L226 Difference]: Without dead ends: 140 [2025-03-17 12:15:36,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2025-03-17 12:15:36,253 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 129 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:36,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 425 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:15:36,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-17 12:15:36,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2025-03-17 12:15:36,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 133 states have internal predecessors, (142), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:15:36,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 148 transitions. [2025-03-17 12:15:36,256 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 148 transitions. Word has length 48 [2025-03-17 12:15:36,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:36,256 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 148 transitions. [2025-03-17 12:15:36,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:15:36,257 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 148 transitions. [2025-03-17 12:15:36,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 12:15:36,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:36,257 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:36,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 12:15:36,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-17 12:15:36,461 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:36,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:36,461 INFO L85 PathProgramCache]: Analyzing trace with hash 717245773, now seen corresponding path program 1 times [2025-03-17 12:15:36,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:36,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814750455] [2025-03-17 12:15:36,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:36,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:36,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 12:15:36,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 12:15:36,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:36,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:36,597 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 12:15:36,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:36,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814750455] [2025-03-17 12:15:36,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814750455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:36,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:36,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:15:36,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294012138] [2025-03-17 12:15:36,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:36,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:15:36,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:36,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:15:36,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:15:36,599 INFO L87 Difference]: Start difference. First operand 139 states and 148 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 12:15:36,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:36,731 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2025-03-17 12:15:36,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:15:36,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2025-03-17 12:15:36,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:36,732 INFO L225 Difference]: With dead ends: 133 [2025-03-17 12:15:36,732 INFO L226 Difference]: Without dead ends: 133 [2025-03-17 12:15:36,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:15:36,733 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 26 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:36,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 388 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:15:36,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-17 12:15:36,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-03-17 12:15:36,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 94 states have (on average 1.446808510638298) internal successors, (136), 127 states have internal predecessors, (136), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:15:36,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2025-03-17 12:15:36,736 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 49 [2025-03-17 12:15:36,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:36,736 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2025-03-17 12:15:36,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 12:15:36,737 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2025-03-17 12:15:36,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 12:15:36,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:36,738 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:36,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 12:15:36,738 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:36,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:36,738 INFO L85 PathProgramCache]: Analyzing trace with hash 2078421545, now seen corresponding path program 1 times [2025-03-17 12:15:36,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:36,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518679386] [2025-03-17 12:15:36,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:36,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:36,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 12:15:36,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 12:15:36,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:36,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:37,597 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:15:37,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:37,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518679386] [2025-03-17 12:15:37,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518679386] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:37,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937947802] [2025-03-17 12:15:37,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:37,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:37,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:37,599 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:15:37,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 12:15:37,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 12:15:37,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 12:15:37,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:37,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:37,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 93 conjuncts are in the unsatisfiable core [2025-03-17 12:15:38,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:38,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:15:38,148 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 12:15:38,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 12:15:38,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:15:38,277 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-03-17 12:15:38,375 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 12:15:38,375 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 34 treesize of output 33 [2025-03-17 12:15:38,408 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 33 treesize of output 17 [2025-03-17 12:15:38,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-17 12:15:38,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 12:15:39,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:15:39,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2025-03-17 12:15:39,058 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2025-03-17 12:15:39,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2025-03-17 12:15:39,184 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 46 treesize of output 26 [2025-03-17 12:15:39,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 12:15:39,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:15:39,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2025-03-17 12:15:39,592 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:15:39,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:15:39,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937947802] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:39,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:15:39,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 28] total 49 [2025-03-17 12:15:39,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199228309] [2025-03-17 12:15:39,899 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:15:39,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-17 12:15:39,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:39,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-17 12:15:39,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=3004, Unknown=0, NotChecked=0, Total=3192 [2025-03-17 12:15:39,901 INFO L87 Difference]: Start difference. First operand 133 states and 142 transitions. Second operand has 50 states, 47 states have (on average 1.8297872340425532) internal successors, (86), 42 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:15:41,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:41,903 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2025-03-17 12:15:41,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 12:15:41,903 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 47 states have (on average 1.8297872340425532) internal successors, (86), 42 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2025-03-17 12:15:41,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:41,904 INFO L225 Difference]: With dead ends: 134 [2025-03-17 12:15:41,904 INFO L226 Difference]: Without dead ends: 134 [2025-03-17 12:15:41,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1243 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=398, Invalid=5302, Unknown=0, NotChecked=0, Total=5700 [2025-03-17 12:15:41,905 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 145 mSDsluCounter, 2039 mSDsCounter, 0 mSdLazyCounter, 2676 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 2123 SdHoareTripleChecker+Invalid, 2690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:41,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 2123 Invalid, 2690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2676 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 12:15:41,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-17 12:15:41,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2025-03-17 12:15:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 126 states have internal predecessors, (135), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:15:41,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2025-03-17 12:15:41,909 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 51 [2025-03-17 12:15:41,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:41,909 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2025-03-17 12:15:41,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 47 states have (on average 1.8297872340425532) internal successors, (86), 42 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:15:41,909 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2025-03-17 12:15:41,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 12:15:41,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:41,909 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:41,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-17 12:15:42,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-17 12:15:42,110 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:42,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:42,110 INFO L85 PathProgramCache]: Analyzing trace with hash 2078421546, now seen corresponding path program 1 times [2025-03-17 12:15:42,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:42,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467380096] [2025-03-17 12:15:42,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:42,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:42,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 12:15:42,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 12:15:42,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:42,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:43,687 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:15:43,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:43,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467380096] [2025-03-17 12:15:43,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467380096] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:43,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793483414] [2025-03-17 12:15:43,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:43,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:43,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:43,689 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:15:43,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 12:15:43,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 12:15:43,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 12:15:43,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:43,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:43,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 130 conjuncts are in the unsatisfiable core [2025-03-17 12:15:43,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:43,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:15:43,971 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 1 [2025-03-17 12:15:44,235 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 12:15:44,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 12:15:44,244 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 14 treesize of output 9 [2025-03-17 12:15:44,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:15:44,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:15:44,445 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 12:15:44,445 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 66 treesize of output 57 [2025-03-17 12:15:44,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-17 12:15:44,612 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 12:15:44,613 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 59 treesize of output 52 [2025-03-17 12:15:44,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-17 12:15:44,675 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 23 treesize of output 11 [2025-03-17 12:15:44,680 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 42 treesize of output 22 [2025-03-17 12:15:44,751 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 43 treesize of output 19 [2025-03-17 12:15:44,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:15:44,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-17 12:15:44,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 12:15:45,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:15:45,048 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 51 treesize of output 34 [2025-03-17 12:15:45,062 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-17 12:15:45,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-17 12:15:45,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-03-17 12:15:45,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 12:15:45,240 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 48 treesize of output 28 [2025-03-17 12:15:45,381 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 25 treesize of output 13 [2025-03-17 12:15:45,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 12:15:45,439 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:15:45,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:15:45,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793483414] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:45,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:15:45,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 50 [2025-03-17 12:15:45,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884714116] [2025-03-17 12:15:45,900 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:15:45,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-17 12:15:45,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:45,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-17 12:15:45,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=3035, Unknown=0, NotChecked=0, Total=3192 [2025-03-17 12:15:45,902 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 51 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 43 states have internal predecessors, (84), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:15:48,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:48,889 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2025-03-17 12:15:48,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 12:15:48,890 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 43 states have internal predecessors, (84), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2025-03-17 12:15:48,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:48,891 INFO L225 Difference]: With dead ends: 132 [2025-03-17 12:15:48,891 INFO L226 Difference]: Without dead ends: 132 [2025-03-17 12:15:48,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=391, Invalid=5929, Unknown=0, NotChecked=0, Total=6320 [2025-03-17 12:15:48,892 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 161 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 2989 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 2235 SdHoareTripleChecker+Invalid, 3004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:48,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 2235 Invalid, 3004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2989 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 12:15:48,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-17 12:15:48,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2025-03-17 12:15:48,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 94 states have (on average 1.425531914893617) internal successors, (134), 125 states have internal predecessors, (134), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:15:48,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2025-03-17 12:15:48,899 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 51 [2025-03-17 12:15:48,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:48,899 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2025-03-17 12:15:48,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 43 states have internal predecessors, (84), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:15:48,900 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2025-03-17 12:15:48,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-17 12:15:48,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:48,900 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:48,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-17 12:15:49,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-17 12:15:49,101 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:49,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:49,101 INFO L85 PathProgramCache]: Analyzing trace with hash 203313991, now seen corresponding path program 1 times [2025-03-17 12:15:49,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:49,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114293213] [2025-03-17 12:15:49,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:49,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:49,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 12:15:49,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 12:15:49,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:49,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:49,242 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-17 12:15:49,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:49,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114293213] [2025-03-17 12:15:49,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114293213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:49,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:49,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:15:49,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591780569] [2025-03-17 12:15:49,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:49,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:15:49,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:49,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:15:49,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:15:49,244 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand has 6 states, 4 states have (on average 8.25) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:15:49,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:49,332 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2025-03-17 12:15:49,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:15:49,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.25) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2025-03-17 12:15:49,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:49,333 INFO L225 Difference]: With dead ends: 128 [2025-03-17 12:15:49,333 INFO L226 Difference]: Without dead ends: 128 [2025-03-17 12:15:49,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:15:49,333 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 130 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:49,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 220 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:15:49,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-17 12:15:49,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2025-03-17 12:15:49,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 121 states have internal predecessors, (130), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:15:49,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2025-03-17 12:15:49,336 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 53 [2025-03-17 12:15:49,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:49,336 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2025-03-17 12:15:49,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.25) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:15:49,337 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2025-03-17 12:15:49,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 12:15:49,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:49,337 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:49,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 12:15:49,337 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:49,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:49,337 INFO L85 PathProgramCache]: Analyzing trace with hash 2111217826, now seen corresponding path program 1 times [2025-03-17 12:15:49,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:49,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505792369] [2025-03-17 12:15:49,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:49,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:49,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 12:15:49,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 12:15:49,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:49,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:49,457 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-17 12:15:49,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:49,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505792369] [2025-03-17 12:15:49,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505792369] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:49,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808646124] [2025-03-17 12:15:49,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:49,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:49,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:49,461 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:15:49,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 12:15:49,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 12:15:49,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 12:15:49,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:49,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:49,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 12:15:49,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:49,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:15:49,722 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 9 treesize of output 3 [2025-03-17 12:15:49,733 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2025-03-17 12:15:49,746 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-17 12:15:49,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2025-03-17 12:15:49,765 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 17 treesize of output 9 [2025-03-17 12:15:49,767 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2025-03-17 12:15:49,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:15:49,864 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 18 treesize of output 10 [2025-03-17 12:15:49,895 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 12:15:49,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808646124] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:15:49,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:15:49,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 10] total 15 [2025-03-17 12:15:49,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442561412] [2025-03-17 12:15:49,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:15:49,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 12:15:49,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:49,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 12:15:49,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=183, Unknown=1, NotChecked=26, Total=240 [2025-03-17 12:15:49,897 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand has 16 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 12:15:50,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:50,286 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2025-03-17 12:15:50,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 12:15:50,286 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 55 [2025-03-17 12:15:50,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:50,287 INFO L225 Difference]: With dead ends: 167 [2025-03-17 12:15:50,287 INFO L226 Difference]: Without dead ends: 167 [2025-03-17 12:15:50,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=403, Unknown=1, NotChecked=40, Total=506 [2025-03-17 12:15:50,287 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 116 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:50,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 811 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 853 Invalid, 0 Unknown, 166 Unchecked, 0.3s Time] [2025-03-17 12:15:50,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-17 12:15:50,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 128. [2025-03-17 12:15:50,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 98 states have (on average 1.346938775510204) internal successors, (132), 122 states have internal predecessors, (132), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:15:50,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2025-03-17 12:15:50,290 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 55 [2025-03-17 12:15:50,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:50,290 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2025-03-17 12:15:50,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 12:15:50,290 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2025-03-17 12:15:50,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 12:15:50,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:50,291 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:50,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-17 12:15:50,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:50,491 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:50,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:50,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2111217827, now seen corresponding path program 1 times [2025-03-17 12:15:50,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:50,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217864066] [2025-03-17 12:15:50,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:50,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:50,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 12:15:50,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 12:15:50,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:50,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:51,012 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:15:51,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:51,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217864066] [2025-03-17 12:15:51,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217864066] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:51,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403205192] [2025-03-17 12:15:51,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:51,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:51,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:51,015 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:15:51,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 12:15:51,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 12:15:51,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 12:15:51,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:51,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:51,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-17 12:15:51,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:51,240 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 1 [2025-03-17 12:15:51,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:15:51,443 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 9 treesize of output 3 [2025-03-17 12:15:51,445 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 9 treesize of output 3 [2025-03-17 12:15:51,602 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-17 12:15:51,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-17 12:15:51,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 12:15:51,784 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 17 treesize of output 9 [2025-03-17 12:15:51,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:15:51,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2025-03-17 12:15:51,861 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 12:15:51,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:15:52,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403205192] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:52,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:15:52,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2025-03-17 12:15:52,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52046552] [2025-03-17 12:15:52,083 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:15:52,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-17 12:15:52,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:52,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-17 12:15:52,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1218, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 12:15:52,084 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand has 33 states, 30 states have (on average 2.933333333333333) internal successors, (88), 28 states have internal predecessors, (88), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 12:15:53,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:53,192 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2025-03-17 12:15:53,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 12:15:53,192 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.933333333333333) internal successors, (88), 28 states have internal predecessors, (88), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 55 [2025-03-17 12:15:53,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:53,193 INFO L225 Difference]: With dead ends: 165 [2025-03-17 12:15:53,193 INFO L226 Difference]: Without dead ends: 165 [2025-03-17 12:15:53,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=219, Invalid=2331, Unknown=0, NotChecked=0, Total=2550 [2025-03-17 12:15:53,194 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 154 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 1768 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 1776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:53,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1254 Invalid, 1776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1768 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 12:15:53,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-17 12:15:53,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 130. [2025-03-17 12:15:53,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 100 states have (on average 1.34) internal successors, (134), 124 states have internal predecessors, (134), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:15:53,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2025-03-17 12:15:53,198 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 55 [2025-03-17 12:15:53,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:53,198 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2025-03-17 12:15:53,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.933333333333333) internal successors, (88), 28 states have internal predecessors, (88), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 12:15:53,199 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2025-03-17 12:15:53,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 12:15:53,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:53,199 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:53,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-17 12:15:53,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-17 12:15:53,400 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:53,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:53,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1030435115, now seen corresponding path program 1 times [2025-03-17 12:15:53,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:53,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703341137] [2025-03-17 12:15:53,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:53,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:53,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 12:15:53,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 12:15:53,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:53,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:53,562 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 12:15:53,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:53,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703341137] [2025-03-17 12:15:53,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703341137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:15:53,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:15:53,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 12:15:53,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633331537] [2025-03-17 12:15:53,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:15:53,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 12:15:53,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:53,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 12:15:53,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 12:15:53,563 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand has 10 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:15:53,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:15:53,835 INFO L93 Difference]: Finished difference Result 170 states and 184 transitions. [2025-03-17 12:15:53,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 12:15:53,836 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2025-03-17 12:15:53,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:15:53,836 INFO L225 Difference]: With dead ends: 170 [2025-03-17 12:15:53,836 INFO L226 Difference]: Without dead ends: 170 [2025-03-17 12:15:53,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 12:15:53,837 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 74 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:15:53,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 657 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:15:53,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-17 12:15:53,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 131. [2025-03-17 12:15:53,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 125 states have internal predecessors, (136), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:15:53,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2025-03-17 12:15:53,840 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 56 [2025-03-17 12:15:53,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:15:53,840 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2025-03-17 12:15:53,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:15:53,840 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2025-03-17 12:15:53,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 12:15:53,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:15:53,841 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:15:53,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 12:15:53,841 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:15:53,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:15:53,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1030435114, now seen corresponding path program 1 times [2025-03-17 12:15:53,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:15:53,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554845107] [2025-03-17 12:15:53,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:53,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:15:53,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 12:15:53,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 12:15:53,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:53,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:54,008 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 12:15:54,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:15:54,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554845107] [2025-03-17 12:15:54,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554845107] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:15:54,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339501838] [2025-03-17 12:15:54,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:15:54,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:15:54,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:15:54,011 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:15:54,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 12:15:54,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 12:15:54,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 12:15:54,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:15:54,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:15:54,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 12:15:54,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:15:54,378 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:15:54,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:15:54,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:15:54,418 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:15:54,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:15:54,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:15:54,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-03-17 12:15:54,570 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 12:15:54,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339501838] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:15:54,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:15:54,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 12] total 24 [2025-03-17 12:15:54,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391833075] [2025-03-17 12:15:54,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:15:54,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 12:15:54,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:15:54,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 12:15:54,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2025-03-17 12:15:54,572 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand has 24 states, 24 states have (on average 3.375) internal successors, (81), 21 states have internal predecessors, (81), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 12:15:58,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:16:02,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:16:06,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:16:10,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:16:14,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:16:18,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:16:22,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:16:22,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:16:22,943 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2025-03-17 12:16:22,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 12:16:22,944 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.375) internal successors, (81), 21 states have internal predecessors, (81), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 56 [2025-03-17 12:16:22,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:16:22,944 INFO L225 Difference]: With dead ends: 106 [2025-03-17 12:16:22,944 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 12:16:22,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992 [2025-03-17 12:16:22,945 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 155 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:16:22,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1160 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 425 Invalid, 7 Unknown, 0 Unchecked, 28.2s Time] [2025-03-17 12:16:22,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 12:16:22,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-17 12:16:22,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 80 states have (on average 1.35) internal successors, (108), 100 states have internal predecessors, (108), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:16:22,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2025-03-17 12:16:22,947 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 56 [2025-03-17 12:16:22,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:16:22,947 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2025-03-17 12:16:22,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.375) internal successors, (81), 21 states have internal predecessors, (81), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 12:16:22,947 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2025-03-17 12:16:22,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-17 12:16:22,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:16:22,947 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:16:22,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-17 12:16:23,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:16:23,153 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:16:23,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:16:23,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2055697465, now seen corresponding path program 1 times [2025-03-17 12:16:23,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:16:23,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759704168] [2025-03-17 12:16:23,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:16:23,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:16:23,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 12:16:23,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 12:16:23,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:16:23,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:16:25,245 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:16:25,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:16:25,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759704168] [2025-03-17 12:16:25,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759704168] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:16:25,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627230920] [2025-03-17 12:16:25,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:16:25,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:16:25,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:16:25,247 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:16:25,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-17 12:16:25,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 12:16:25,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 12:16:25,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:16:25,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:16:25,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 132 conjuncts are in the unsatisfiable core [2025-03-17 12:16:25,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:16:25,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:16:25,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:16:25,724 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:16:25,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:16:25,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 12:16:25,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:16:25,887 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 12:16:25,888 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 48 treesize of output 43 [2025-03-17 12:16:25,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-17 12:16:26,021 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 12:16:26,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2025-03-17 12:16:26,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-17 12:16:26,083 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 12 [2025-03-17 12:16:26,086 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 23 treesize of output 11 [2025-03-17 12:16:26,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-17 12:16:26,212 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 9 treesize of output 3 [2025-03-17 12:16:26,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-17 12:16:26,518 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-17 12:16:26,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-17 12:16:26,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 12:16:26,536 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 25 treesize of output 20 [2025-03-17 12:16:26,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:16:26,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2025-03-17 12:16:27,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2025-03-17 12:16:27,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 12:16:27,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 12:16:27,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 12:16:27,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 12:16:27,565 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:16:27,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:16:28,264 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3906 (Array Int Int)) (v_ArrVal_3908 (Array Int Int)) (v_ArrVal_3909 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_36| Int)) (or (< |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_36| 0) (< |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.offset| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_36|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base| v_ArrVal_3906) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_3908) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base|) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_36|) v_ArrVal_3909) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= v_ArrVal_3906 (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base|) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_36| (select v_ArrVal_3906 |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_36|)))))) is different from false [2025-03-17 12:16:28,277 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3906 (Array Int Int)) (v_ArrVal_3908 (Array Int Int)) (v_ArrVal_3909 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_36| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (< |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_36| 0) (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_36|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| .cse0 v_ArrVal_3906) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_3908) (select (select |c_#memory_$Pointer$#2.base| .cse0) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_36|) v_ArrVal_3909) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= v_ArrVal_3906 (store (select |c_#memory_int#2| .cse0) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_36| (select v_ArrVal_3906 |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_36|))))))) is different from false [2025-03-17 12:16:28,289 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3906 (Array Int Int)) (v_ArrVal_3908 (Array Int Int)) (v_ArrVal_3909 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_36| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (< |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_36| 0) (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_36|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| .cse0 v_ArrVal_3906) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_3908) (select (select |c_#memory_$Pointer$#2.base| .cse0) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_36|) v_ArrVal_3909) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= v_ArrVal_3906 (store (select |c_#memory_int#2| .cse0) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_36| (select v_ArrVal_3906 |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_36|))))))) is different from false [2025-03-17 12:16:28,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627230920] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:16:28,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:16:28,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36] total 67 [2025-03-17 12:16:28,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971460702] [2025-03-17 12:16:28,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:16:28,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-03-17 12:16:28,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:16:28,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-03-17 12:16:28,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=5518, Unknown=51, NotChecked=456, Total=6320 [2025-03-17 12:16:28,487 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand has 67 states, 63 states have (on average 1.507936507936508) internal successors, (95), 57 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:16:31,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:16:31,020 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2025-03-17 12:16:31,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-17 12:16:31,020 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 63 states have (on average 1.507936507936508) internal successors, (95), 57 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 59 [2025-03-17 12:16:31,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:16:31,021 INFO L225 Difference]: With dead ends: 110 [2025-03-17 12:16:31,021 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 12:16:31,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2608 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=517, Invalid=9344, Unknown=51, NotChecked=594, Total=10506 [2025-03-17 12:16:31,023 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 114 mSDsluCounter, 2596 mSDsCounter, 0 mSdLazyCounter, 2502 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 2661 SdHoareTripleChecker+Invalid, 2530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 12:16:31,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 2661 Invalid, 2530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2502 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 12:16:31,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 12:16:31,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 106. [2025-03-17 12:16:31,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 80 states have (on average 1.3375) internal successors, (107), 100 states have internal predecessors, (107), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:16:31,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2025-03-17 12:16:31,027 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 59 [2025-03-17 12:16:31,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:16:31,027 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2025-03-17 12:16:31,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 63 states have (on average 1.507936507936508) internal successors, (95), 57 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:16:31,027 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2025-03-17 12:16:31,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 12:16:31,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:16:31,027 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:16:31,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-17 12:16:31,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:16:31,237 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:16:31,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:16:31,238 INFO L85 PathProgramCache]: Analyzing trace with hash -68079866, now seen corresponding path program 1 times [2025-03-17 12:16:31,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:16:31,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125009490] [2025-03-17 12:16:31,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:16:31,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:16:31,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 12:16:31,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 12:16:31,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:16:31,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:16:32,437 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:16:32,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:16:32,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125009490] [2025-03-17 12:16:32,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125009490] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:16:32,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771568445] [2025-03-17 12:16:32,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:16:32,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:16:32,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:16:32,441 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:16:32,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-17 12:16:32,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 12:16:32,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 12:16:32,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:16:32,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:16:32,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 12:16:32,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:16:32,856 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-17 12:16:32,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:16:33,028 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-17 12:16:33,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771568445] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:16:33,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:16:33,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 8, 8] total 47 [2025-03-17 12:16:33,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614770511] [2025-03-17 12:16:33,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:16:33,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-17 12:16:33,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:16:33,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-17 12:16:33,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=2036, Unknown=0, NotChecked=0, Total=2162 [2025-03-17 12:16:33,030 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand has 47 states, 46 states have (on average 2.347826086956522) internal successors, (108), 42 states have internal predecessors, (108), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-17 12:16:34,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:16:34,396 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2025-03-17 12:16:34,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-17 12:16:34,396 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.347826086956522) internal successors, (108), 42 states have internal predecessors, (108), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 61 [2025-03-17 12:16:34,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:16:34,397 INFO L225 Difference]: With dead ends: 103 [2025-03-17 12:16:34,397 INFO L226 Difference]: Without dead ends: 103 [2025-03-17 12:16:34,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=321, Invalid=4371, Unknown=0, NotChecked=0, Total=4692 [2025-03-17 12:16:34,398 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 58 mSDsluCounter, 1431 mSDsCounter, 0 mSdLazyCounter, 1907 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1482 SdHoareTripleChecker+Invalid, 1925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 12:16:34,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1482 Invalid, 1925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1907 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 12:16:34,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-17 12:16:34,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2025-03-17 12:16:34,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.2727272727272727) internal successors, (98), 93 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:16:34,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2025-03-17 12:16:34,401 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 61 [2025-03-17 12:16:34,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:16:34,401 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2025-03-17 12:16:34,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.347826086956522) internal successors, (108), 42 states have internal predecessors, (108), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-17 12:16:34,401 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2025-03-17 12:16:34,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 12:16:34,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:16:34,401 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:16:34,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-17 12:16:34,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:16:34,602 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:16:34,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:16:34,603 INFO L85 PathProgramCache]: Analyzing trace with hash -68079849, now seen corresponding path program 1 times [2025-03-17 12:16:34,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:16:34,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291256820] [2025-03-17 12:16:34,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:16:34,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:16:34,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 12:16:34,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 12:16:34,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:16:34,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:16:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 12:16:35,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:16:35,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291256820] [2025-03-17 12:16:35,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291256820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:16:35,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069690867] [2025-03-17 12:16:35,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:16:35,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:16:35,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:16:35,577 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:16:35,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-17 12:16:35,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 12:16:35,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 12:16:35,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:16:35,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:16:35,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 150 conjuncts are in the unsatisfiable core [2025-03-17 12:16:35,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:16:35,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:16:35,853 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 1 [2025-03-17 12:16:36,076 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:16:36,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 12:16:36,086 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:16:36,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:16:36,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:16:36,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:16:36,208 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-03-17 12:16:36,218 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-03-17 12:16:36,323 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 12:16:36,323 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 59 treesize of output 52 [2025-03-17 12:16:36,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-17 12:16:36,374 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 23 treesize of output 11 [2025-03-17 12:16:36,378 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 42 treesize of output 22 [2025-03-17 12:16:36,441 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 43 treesize of output 19 [2025-03-17 12:16:36,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-17 12:16:36,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 12:16:36,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:16:36,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:16:36,715 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 51 treesize of output 34 [2025-03-17 12:16:36,728 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-03-17 12:16:36,728 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 1 case distinctions, treesize of input 22 treesize of output 29 [2025-03-17 12:16:36,745 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-17 12:16:36,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-17 12:16:36,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 12:16:37,256 INFO L349 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2025-03-17 12:16:37,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 67 [2025-03-17 12:16:37,272 INFO L349 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2025-03-17 12:16:37,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2025-03-17 12:16:37,563 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-03-17 12:16:37,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 203 treesize of output 163 [2025-03-17 12:16:37,577 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-03-17 12:16:37,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 206 treesize of output 204 [2025-03-17 12:16:37,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:16:37,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:16:37,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:16:37,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:16:37,738 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-17 12:16:37,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 12:16:37,861 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 81 treesize of output 58 [2025-03-17 12:16:37,918 INFO L349 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2025-03-17 12:16:37,918 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 1 case distinctions, treesize of input 110 treesize of output 84 [2025-03-17 12:16:37,936 INFO L349 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2025-03-17 12:16:37,936 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 1 case distinctions, treesize of input 25 treesize of output 24 [2025-03-17 12:16:38,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:16:38,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 167 [2025-03-17 12:16:38,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:16:38,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 155 [2025-03-17 12:16:39,027 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 94 treesize of output 70 [2025-03-17 12:16:39,123 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:16:39,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:16:39,558 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_4387 (Array Int Int)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.offset| Int)) (<= 0 (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_4387))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) .cse1) .cse2) 8))) (forall ((v_ArrVal_4387 (Array Int Int)) (v_ArrVal_4388 (Array Int Int)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.offset| Int)) (let ((.cse4 (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4))) (<= (+ (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_4387))) (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) .cse1) .cse2) 12) (select |c_#length| (select (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_4388))) (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) .cse1) .cse2))))))) is different from false [2025-03-17 12:16:44,332 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((|ULTIMATE.start_dll_circular_insert_~last~1#1.offset| Int)) (or (< |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (forall ((v_ArrVal_4387 (Array Int Int)) (v_ArrVal_4388 (Array Int Int)) (v_subst_16 Int) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse1 (select .cse6 |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse2 (+ v_subst_16 4))) (<= (+ (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_4387))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) .cse3) .cse4) 12) (select |c_#length| (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse6 |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_4388))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) .cse3) .cse4)))))))) (forall ((|ULTIMATE.start_dll_circular_insert_~last~1#1.offset| Int)) (or (forall ((v_subst_15 Int) (v_ArrVal_4387 (Array Int Int)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| Int)) (<= 0 (+ 8 (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_4387)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (store .cse7 .cse8 (store (select .cse7 .cse8) (+ v_subst_15 4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) .cse3) .cse4)))) (< |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0))))) is different from false [2025-03-17 12:16:44,393 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((|ULTIMATE.start_dll_circular_insert_~last~1#1.offset| Int)) (or (< |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (forall ((v_subst_15 Int) (v_ArrVal_4387 (Array Int Int)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| Int)) (<= 0 (+ 8 (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_4387)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ v_subst_15 4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|))) .cse2) .cse3)))))) (forall ((|ULTIMATE.start_dll_circular_insert_~last~1#1.offset| Int)) (or (< |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (forall ((v_ArrVal_4387 (Array Int Int)) (v_ArrVal_4388 (Array Int Int)) (v_subst_16 Int) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| Int)) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse5 (select .cse8 |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse6 (+ v_subst_16 4))) (<= (+ 12 (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$#2.offset| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_4387))) (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|))) .cse2) .cse3)) (select |c_#length| (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse8 |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_4388))) (store .cse7 .cse5 (store (select .cse7 .cse5) .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) .cse2) .cse3)))))))))) is different from false [2025-03-17 12:16:44,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069690867] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:16:44,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:16:44,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 32] total 50 [2025-03-17 12:16:44,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762835898] [2025-03-17 12:16:44,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:16:44,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-17 12:16:44,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:16:44,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-17 12:16:44,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=3457, Unknown=8, NotChecked=360, Total=4032 [2025-03-17 12:16:44,888 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 51 states, 48 states have (on average 2.125) internal successors, (102), 44 states have internal predecessors, (102), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:16:48,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:16:48,419 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2025-03-17 12:16:48,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-17 12:16:48,420 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 2.125) internal successors, (102), 44 states have internal predecessors, (102), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 61 [2025-03-17 12:16:48,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:16:48,420 INFO L225 Difference]: With dead ends: 101 [2025-03-17 12:16:48,420 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 12:16:48,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=441, Invalid=6535, Unknown=8, NotChecked=498, Total=7482 [2025-03-17 12:16:48,421 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 96 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 2403 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 2413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 12:16:48,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 1678 Invalid, 2413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2403 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 12:16:48,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 12:16:48,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2025-03-17 12:16:48,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 91 states have internal predecessors, (96), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:16:48,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2025-03-17 12:16:48,423 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 61 [2025-03-17 12:16:48,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:16:48,423 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2025-03-17 12:16:48,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 2.125) internal successors, (102), 44 states have internal predecessors, (102), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:16:48,424 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2025-03-17 12:16:48,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 12:16:48,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:16:48,424 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:16:48,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-17 12:16:48,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:16:48,625 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 79 more)] === [2025-03-17 12:16:48,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:16:48,625 INFO L85 PathProgramCache]: Analyzing trace with hash 856086300, now seen corresponding path program 1 times [2025-03-17 12:16:48,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:16:48,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865102929] [2025-03-17 12:16:48,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:16:48,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:16:48,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 12:16:48,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 12:16:48,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:16:48,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat