./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/list-simple/dll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/list-simple/dll2c_insert_equal.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 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:39:03,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:39:03,317 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:39:03,323 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:39:03,323 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:39:03,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:39:03,350 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:39:03,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:39:03,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:39:03,350 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:39:03,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:39:03,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:39:03,351 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:39:03,351 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:39:03,352 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:39:03,352 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:39:03,352 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:39:03,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:39:03,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:39:03,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:39:03,353 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:39:03,353 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:39:03,353 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:39:03,353 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:39:03,353 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:39:03,353 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:39:03,353 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:39:03,353 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:39:03,354 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:39:03,354 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:39:03,354 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:39:03,354 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:39:03,354 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:39:03,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:39:03,355 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:39:03,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:39:03,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:39:03,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:39:03,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:39:03,355 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:39:03,355 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:39:03,355 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:39:03,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:39:03,355 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:39:03,355 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:39:03,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:39:03,356 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 -> 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 [2025-04-30 10:39:03,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:39:03,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:39:03,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:39:03,620 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:39:03,620 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:39:03,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_insert_equal.i [2025-04-30 10:39:05,014 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a7b02b2/cdd16d3ab91246b2b2db4ee23c50c98a/FLAGa891ede7f [2025-04-30 10:39:05,263 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:39:05,263 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_equal.i [2025-04-30 10:39:05,272 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a7b02b2/cdd16d3ab91246b2b2db4ee23c50c98a/FLAGa891ede7f [2025-04-30 10:39:06,016 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a7b02b2/cdd16d3ab91246b2b2db4ee23c50c98a [2025-04-30 10:39:06,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:39:06,019 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:39:06,020 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:39:06,020 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:39:06,023 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:39:06,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:39:06" (1/1) ... [2025-04-30 10:39:06,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6937f0a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:06, skipping insertion in model container [2025-04-30 10:39:06,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:39:06" (1/1) ... [2025-04-30 10:39:06,051 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:39:06,278 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:39:06,285 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:39:06,361 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:39:06,386 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:39:06,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:06 WrapperNode [2025-04-30 10:39:06,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:39:06,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:39:06,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:39:06,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:39:06,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:06" (1/1) ... [2025-04-30 10:39:06,408 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:06" (1/1) ... [2025-04-30 10:39:06,434 INFO L138 Inliner]: procedures = 127, calls = 54, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 154 [2025-04-30 10:39:06,434 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:39:06,434 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:39:06,434 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:39:06,434 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:39:06,443 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:06" (1/1) ... [2025-04-30 10:39:06,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:06" (1/1) ... [2025-04-30 10:39:06,448 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:06" (1/1) ... [2025-04-30 10:39:06,463 INFO L175 MemorySlicer]: Split 35 memory accesses to 3 slices as follows [2, 11, 22]. 63 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 18 writes are split as follows [0, 1, 17]. [2025-04-30 10:39:06,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:06" (1/1) ... [2025-04-30 10:39:06,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:06" (1/1) ... [2025-04-30 10:39:06,473 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:06" (1/1) ... [2025-04-30 10:39:06,475 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:06" (1/1) ... [2025-04-30 10:39:06,477 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:06" (1/1) ... [2025-04-30 10:39:06,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:06" (1/1) ... [2025-04-30 10:39:06,484 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:06" (1/1) ... [2025-04-30 10:39:06,489 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:39:06,490 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:39:06,493 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:39:06,493 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:39:06,494 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:06" (1/1) ... [2025-04-30 10:39:06,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:39:06,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:06,518 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:39:06,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:39:06,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:39:06,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:39:06,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-30 10:39:06,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:39:06,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:39:06,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-30 10:39:06,536 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-30 10:39:06,536 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-30 10:39:06,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:39:06,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:39:06,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:39:06,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:39:06,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:39:06,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-30 10:39:06,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:39:06,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:39:06,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:39:06,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:39:06,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-30 10:39:06,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-30 10:39:06,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-30 10:39:06,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:39:06,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:39:06,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:39:06,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:39:06,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:39:06,659 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:39:06,661 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:39:07,074 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2025-04-30 10:39:07,074 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:39:07,088 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:39:07,089 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-30 10:39:07,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:39:07 BoogieIcfgContainer [2025-04-30 10:39:07,090 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:39:07,091 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:39:07,092 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:39:07,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:39:07,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:39:06" (1/3) ... [2025-04-30 10:39:07,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b5032c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:39:07, skipping insertion in model container [2025-04-30 10:39:07,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:39:06" (2/3) ... [2025-04-30 10:39:07,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b5032c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:39:07, skipping insertion in model container [2025-04-30 10:39:07,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:39:07" (3/3) ... [2025-04-30 10:39:07,098 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2025-04-30 10:39:07,109 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:39:07,111 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_insert_equal.i that has 2 procedures, 157 locations, 174 edges, 1 initial locations, 4 loop locations, and 72 error locations. [2025-04-30 10:39:07,147 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:39:07,156 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@4f5da675, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:39:07,157 INFO L341 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2025-04-30 10:39:07,160 INFO L278 IsEmpty]: Start isEmpty. Operand has 157 states, 80 states have (on average 2.0625) internal successors, (165), 152 states have internal predecessors, (165), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:07,163 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-30 10:39:07,163 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:07,164 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:39:07,164 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:07,168 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:07,168 INFO L85 PathProgramCache]: Analyzing trace with hash 896226674, now seen corresponding path program 1 times [2025-04-30 10:39:07,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:07,173 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546220964] [2025-04-30 10:39:07,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:07,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:07,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:39:07,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:39:07,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:07,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:07,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:39:07,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:07,362 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546220964] [2025-04-30 10:39:07,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546220964] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:07,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:39:07,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:39:07,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709811771] [2025-04-30 10:39:07,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:07,367 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:39:07,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:07,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:39:07,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:39:07,386 INFO L87 Difference]: Start difference. First operand has 157 states, 80 states have (on average 2.0625) internal successors, (165), 152 states have internal predecessors, (165), 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.5) internal successors, (5), 3 states have internal predecessors, (5), 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-04-30 10:39:07,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:07,513 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2025-04-30 10:39:07,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:39:07,514 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2025-04-30 10:39:07,515 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:07,519 INFO L225 Difference]: With dead ends: 153 [2025-04-30 10:39:07,519 INFO L226 Difference]: Without dead ends: 150 [2025-04-30 10:39:07,520 INFO L436 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-04-30 10:39:07,522 INFO L437 NwaCegarLoop]: 155 mSDtfsCounter, 3 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:07,522 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 242 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:39:07,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-04-30 10:39:07,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-04-30 10:39:07,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 77 states have (on average 2.0) internal successors, (154), 145 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:07,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2025-04-30 10:39:07,558 INFO L79 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 6 [2025-04-30 10:39:07,558 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:07,558 INFO L485 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2025-04-30 10:39:07,559 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-04-30 10:39:07,559 INFO L278 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2025-04-30 10:39:07,559 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-30 10:39:07,559 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:07,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:39:07,559 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:39:07,559 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:07,560 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:07,560 INFO L85 PathProgramCache]: Analyzing trace with hash 896226675, now seen corresponding path program 1 times [2025-04-30 10:39:07,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:07,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416846921] [2025-04-30 10:39:07,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:07,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:07,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:39:07,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:39:07,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:07,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:07,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:39:07,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:07,655 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416846921] [2025-04-30 10:39:07,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416846921] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:07,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:39:07,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:39:07,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926408172] [2025-04-30 10:39:07,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:07,657 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:39:07,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:07,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:39:07,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:39:07,657 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-04-30 10:39:07,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:07,751 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2025-04-30 10:39:07,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:39:07,752 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2025-04-30 10:39:07,752 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:07,753 INFO L225 Difference]: With dead ends: 147 [2025-04-30 10:39:07,753 INFO L226 Difference]: Without dead ends: 147 [2025-04-30 10:39:07,753 INFO L436 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-04-30 10:39:07,753 INFO L437 NwaCegarLoop]: 152 mSDtfsCounter, 3 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:07,754 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 243 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:39:07,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-04-30 10:39:07,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-04-30 10:39:07,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 77 states have (on average 1.9610389610389611) internal successors, (151), 142 states have internal predecessors, (151), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:07,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2025-04-30 10:39:07,762 INFO L79 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 6 [2025-04-30 10:39:07,763 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:07,763 INFO L485 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2025-04-30 10:39:07,763 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-04-30 10:39:07,763 INFO L278 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2025-04-30 10:39:07,764 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:39:07,764 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:07,764 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:07,764 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:39:07,765 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:07,765 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:07,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1788594726, now seen corresponding path program 1 times [2025-04-30 10:39:07,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:07,769 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859376765] [2025-04-30 10:39:07,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:07,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:07,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:39:07,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:39:07,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:07,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:07,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:39:07,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:07,865 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859376765] [2025-04-30 10:39:07,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859376765] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:07,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:39:07,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:39:07,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7175908] [2025-04-30 10:39:07,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:07,865 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:39:07,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:07,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:39:07,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:39:07,866 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:39:07,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:07,876 INFO L93 Difference]: Finished difference Result 158 states and 170 transitions. [2025-04-30 10:39:07,877 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:39:07,877 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2025-04-30 10:39:07,877 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:07,878 INFO L225 Difference]: With dead ends: 158 [2025-04-30 10:39:07,878 INFO L226 Difference]: Without dead ends: 158 [2025-04-30 10:39:07,878 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:39:07,878 INFO L437 NwaCegarLoop]: 155 mSDtfsCounter, 10 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:07,879 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 305 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:39:07,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-04-30 10:39:07,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 148. [2025-04-30 10:39:07,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 78 states have (on average 1.9487179487179487) internal successors, (152), 143 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-04-30 10:39:07,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2025-04-30 10:39:07,886 INFO L79 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 14 [2025-04-30 10:39:07,886 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:07,886 INFO L485 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2025-04-30 10:39:07,886 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:39:07,886 INFO L278 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2025-04-30 10:39:07,886 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-30 10:39:07,887 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:07,887 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:07,887 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:39:07,887 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:07,887 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:07,887 INFO L85 PathProgramCache]: Analyzing trace with hash -969783451, now seen corresponding path program 1 times [2025-04-30 10:39:07,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:07,888 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197187847] [2025-04-30 10:39:07,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:07,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:07,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:39:07,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:39:07,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:07,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:08,058 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:39:08,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:08,059 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197187847] [2025-04-30 10:39:08,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197187847] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:08,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:39:08,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:39:08,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203118718] [2025-04-30 10:39:08,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:08,060 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:39:08,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:08,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:39:08,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:39:08,061 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-04-30 10:39:08,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:08,244 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2025-04-30 10:39:08,244 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:39:08,244 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 24 [2025-04-30 10:39:08,244 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:08,245 INFO L225 Difference]: With dead ends: 147 [2025-04-30 10:39:08,245 INFO L226 Difference]: Without dead ends: 147 [2025-04-30 10:39:08,245 INFO L436 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-04-30 10:39:08,246 INFO L437 NwaCegarLoop]: 145 mSDtfsCounter, 7 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:08,246 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 455 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:39:08,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-04-30 10:39:08,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-04-30 10:39:08,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 78 states have (on average 1.935897435897436) internal successors, (151), 142 states have internal predecessors, (151), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:08,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2025-04-30 10:39:08,250 INFO L79 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 24 [2025-04-30 10:39:08,251 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:08,251 INFO L485 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2025-04-30 10:39:08,251 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-04-30 10:39:08,251 INFO L278 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2025-04-30 10:39:08,251 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-30 10:39:08,251 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:08,251 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:08,252 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:39:08,252 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:08,252 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:08,252 INFO L85 PathProgramCache]: Analyzing trace with hash -969783450, now seen corresponding path program 1 times [2025-04-30 10:39:08,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:08,252 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054895007] [2025-04-30 10:39:08,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:08,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:08,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:39:08,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:39:08,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:08,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:08,433 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:39:08,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:08,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054895007] [2025-04-30 10:39:08,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054895007] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:08,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:39:08,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:39:08,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441011414] [2025-04-30 10:39:08,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:08,434 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:39:08,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:08,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:39:08,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:39:08,436 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-04-30 10:39:08,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:08,635 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2025-04-30 10:39:08,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:39:08,635 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 24 [2025-04-30 10:39:08,635 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:08,636 INFO L225 Difference]: With dead ends: 146 [2025-04-30 10:39:08,636 INFO L226 Difference]: Without dead ends: 146 [2025-04-30 10:39:08,636 INFO L436 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-04-30 10:39:08,637 INFO L437 NwaCegarLoop]: 145 mSDtfsCounter, 6 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:08,637 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 479 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:39:08,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-04-30 10:39:08,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2025-04-30 10:39:08,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 78 states have (on average 1.9230769230769231) internal successors, (150), 141 states have internal predecessors, (150), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:08,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2025-04-30 10:39:08,641 INFO L79 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 24 [2025-04-30 10:39:08,641 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:08,641 INFO L485 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions. [2025-04-30 10:39:08,641 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-04-30 10:39:08,641 INFO L278 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2025-04-30 10:39:08,642 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:39:08,642 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:08,642 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:08,642 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:39:08,642 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:08,643 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:08,643 INFO L85 PathProgramCache]: Analyzing trace with hash 46006374, now seen corresponding path program 1 times [2025-04-30 10:39:08,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:08,643 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230783195] [2025-04-30 10:39:08,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:08,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:08,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:39:08,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:39:08,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:08,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:08,815 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:39:08,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:08,816 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230783195] [2025-04-30 10:39:08,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230783195] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:08,816 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407881770] [2025-04-30 10:39:08,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:08,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:08,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:08,818 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:39:08,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:39:08,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:39:08,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:39:08,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:08,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:08,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-30 10:39:08,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:08,941 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:39:08,984 WARN L871 $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-04-30 10:39:09,020 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-30 10:39:09,020 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-30 10:39:09,038 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-04-30 10:39:09,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:09,207 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:39:09,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407881770] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:39:09,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:39:09,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 11 [2025-04-30 10:39:09,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300654804] [2025-04-30 10:39:09,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:09,208 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:39:09,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:09,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:39:09,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2025-04-30 10:39:09,209 INFO L87 Difference]: Start difference. First operand 146 states and 156 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 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-04-30 10:39:09,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:09,530 INFO L93 Difference]: Finished difference Result 151 states and 164 transitions. [2025-04-30 10:39:09,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:39:09,530 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 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 26 [2025-04-30 10:39:09,530 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:09,532 INFO L225 Difference]: With dead ends: 151 [2025-04-30 10:39:09,532 INFO L226 Difference]: Without dead ends: 151 [2025-04-30 10:39:09,532 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 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-04-30 10:39:09,533 INFO L437 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:09,533 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 581 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 484 Invalid, 0 Unknown, 157 Unchecked, 0.3s Time] [2025-04-30 10:39:09,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-04-30 10:39:09,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-04-30 10:39:09,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 82 states have (on average 1.9024390243902438) internal successors, (156), 145 states have internal predecessors, (156), 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-04-30 10:39:09,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 164 transitions. [2025-04-30 10:39:09,545 INFO L79 Accepts]: Start accepts. Automaton has 151 states and 164 transitions. Word has length 26 [2025-04-30 10:39:09,546 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:09,546 INFO L485 AbstractCegarLoop]: Abstraction has 151 states and 164 transitions. [2025-04-30 10:39:09,546 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 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-04-30 10:39:09,546 INFO L278 IsEmpty]: Start isEmpty. Operand 151 states and 164 transitions. [2025-04-30 10:39:09,546 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:39:09,546 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:09,546 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:09,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:39:09,747 WARN L466 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-04-30 10:39:09,747 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:09,747 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:09,747 INFO L85 PathProgramCache]: Analyzing trace with hash 46006375, now seen corresponding path program 1 times [2025-04-30 10:39:09,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:09,748 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384036352] [2025-04-30 10:39:09,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:09,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:09,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:39:09,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:39:09,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:09,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:10,137 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:39:10,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:10,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384036352] [2025-04-30 10:39:10,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384036352] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:10,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801059161] [2025-04-30 10:39:10,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:10,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:10,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:10,139 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:39:10,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:39:10,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:39:10,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:39:10,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:10,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:10,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-30 10:39:10,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:10,239 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:39:10,243 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:39:10,348 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-30 10:39:10,350 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-30 10:39:10,373 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:39:10,373 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-30 10:39:10,405 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:39:10,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:10,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801059161] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:10,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:39:10,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2025-04-30 10:39:10,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870972113] [2025-04-30 10:39:10,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:10,506 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:39:10,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:10,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:39:10,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:39:10,507 INFO L87 Difference]: Start difference. First operand 151 states and 164 transitions. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:39:10,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:10,975 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2025-04-30 10:39:10,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:39:10,975 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2025-04-30 10:39:10,976 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:10,976 INFO L225 Difference]: With dead ends: 151 [2025-04-30 10:39:10,976 INFO L226 Difference]: Without dead ends: 151 [2025-04-30 10:39:10,977 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:39:10,977 INFO L437 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:10,977 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 757 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:39:10,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-04-30 10:39:10,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-04-30 10:39:10,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 82 states have (on average 1.8902439024390243) internal successors, (155), 145 states have internal predecessors, (155), 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-04-30 10:39:10,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2025-04-30 10:39:10,982 INFO L79 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 26 [2025-04-30 10:39:10,982 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:10,986 INFO L485 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2025-04-30 10:39:10,987 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:39:10,987 INFO L278 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2025-04-30 10:39:10,987 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-30 10:39:10,987 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:10,987 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-04-30 10:39:10,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:39:11,188 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-04-30 10:39:11,188 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:11,188 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:11,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1262607016, now seen corresponding path program 1 times [2025-04-30 10:39:11,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:11,188 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184208278] [2025-04-30 10:39:11,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:11,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:11,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:39:11,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:39:11,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:11,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:11,262 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:39:11,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:11,262 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184208278] [2025-04-30 10:39:11,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184208278] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:11,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7395072] [2025-04-30 10:39:11,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:11,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:11,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:11,264 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:39:11,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:39:11,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:39:11,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:39:11,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:11,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:11,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-30 10:39:11,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:11,383 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:39:11,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:11,415 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:39:11,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7395072] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:39:11,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:39:11,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-04-30 10:39:11,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183666218] [2025-04-30 10:39:11,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:11,415 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:39:11,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:11,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:39:11,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:39:11,416 INFO L87 Difference]: Start difference. First operand 151 states and 163 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-04-30 10:39:11,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:11,454 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2025-04-30 10:39:11,454 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:39:11,455 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 28 [2025-04-30 10:39:11,455 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:11,455 INFO L225 Difference]: With dead ends: 151 [2025-04-30 10:39:11,455 INFO L226 Difference]: Without dead ends: 151 [2025-04-30 10:39:11,455 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 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-04-30 10:39:11,456 INFO L437 NwaCegarLoop]: 146 mSDtfsCounter, 1 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:11,456 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 714 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:39:11,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-04-30 10:39:11,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-04-30 10:39:11,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 82 states have (on average 1.8780487804878048) internal successors, (154), 145 states have internal predecessors, (154), 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-04-30 10:39:11,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2025-04-30 10:39:11,465 INFO L79 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 28 [2025-04-30 10:39:11,465 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:11,465 INFO L485 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2025-04-30 10:39:11,465 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-04-30 10:39:11,466 INFO L278 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2025-04-30 10:39:11,466 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-30 10:39:11,466 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:11,466 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-04-30 10:39:11,473 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-04-30 10:39:11,666 WARN L466 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-04-30 10:39:11,667 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:11,668 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:11,668 INFO L85 PathProgramCache]: Analyzing trace with hash 481313524, now seen corresponding path program 1 times [2025-04-30 10:39:11,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:11,668 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891811894] [2025-04-30 10:39:11,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:11,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:11,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-30 10:39:11,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-30 10:39:11,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:11,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:11,727 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-30 10:39:11,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:11,728 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891811894] [2025-04-30 10:39:11,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891811894] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:11,728 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296066930] [2025-04-30 10:39:11,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:11,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:11,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:11,730 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:39:11,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:39:11,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-30 10:39:11,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-30 10:39:11,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:11,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:11,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-30 10:39:11,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:11,820 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:39:11,870 WARN L871 $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-04-30 10:39:11,915 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:39:11,915 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-30 10:39:11,924 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2025-04-30 10:39:11,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:11,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296066930] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:11,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:39:11,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2025-04-30 10:39:11,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997957158] [2025-04-30 10:39:11,964 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:11,964 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:39:11,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:11,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:39:11,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2025-04-30 10:39:11,965 INFO L87 Difference]: Start difference. First operand 151 states and 162 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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-04-30 10:39:12,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:12,255 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2025-04-30 10:39:12,255 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:39:12,255 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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 29 [2025-04-30 10:39:12,256 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:12,256 INFO L225 Difference]: With dead ends: 150 [2025-04-30 10:39:12,256 INFO L226 Difference]: Without dead ends: 150 [2025-04-30 10:39:12,256 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 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-04-30 10:39:12,257 INFO L437 NwaCegarLoop]: 138 mSDtfsCounter, 9 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:12,257 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 713 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 491 Invalid, 0 Unknown, 154 Unchecked, 0.2s Time] [2025-04-30 10:39:12,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-04-30 10:39:12,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-04-30 10:39:12,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 82 states have (on average 1.8658536585365855) internal successors, (153), 144 states have internal predecessors, (153), 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-04-30 10:39:12,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 161 transitions. [2025-04-30 10:39:12,264 INFO L79 Accepts]: Start accepts. Automaton has 150 states and 161 transitions. Word has length 29 [2025-04-30 10:39:12,264 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:12,264 INFO L485 AbstractCegarLoop]: Abstraction has 150 states and 161 transitions. [2025-04-30 10:39:12,264 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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-04-30 10:39:12,264 INFO L278 IsEmpty]: Start isEmpty. Operand 150 states and 161 transitions. [2025-04-30 10:39:12,265 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-30 10:39:12,265 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:12,265 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-04-30 10:39:12,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-30 10:39:12,468 WARN L466 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-04-30 10:39:12,470 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:12,471 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:12,471 INFO L85 PathProgramCache]: Analyzing trace with hash 481313525, now seen corresponding path program 1 times [2025-04-30 10:39:12,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:12,471 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354041040] [2025-04-30 10:39:12,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:12,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:12,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-30 10:39:12,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-30 10:39:12,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:12,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:12,613 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:39:12,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:12,613 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354041040] [2025-04-30 10:39:12,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354041040] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:12,613 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958738545] [2025-04-30 10:39:12,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:12,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:12,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:12,617 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:39:12,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:39:12,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-30 10:39:12,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-30 10:39:12,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:12,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:12,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-30 10:39:12,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:12,721 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:39:12,725 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:39:12,827 WARN L871 $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-04-30 10:39:12,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:39:12,855 INFO L354 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-04-30 10:39:12,860 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:39:12,860 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-30 10:39:12,894 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-04-30 10:39:12,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:12,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958738545] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:12,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:39:12,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2025-04-30 10:39:12,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232861402] [2025-04-30 10:39:12,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:12,985 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-30 10:39:12,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:12,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-30 10:39:12,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2025-04-30 10:39:12,986 INFO L87 Difference]: Start difference. First operand 150 states and 161 transitions. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 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-04-30 10:39:13,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:13,343 INFO L93 Difference]: Finished difference Result 167 states and 183 transitions. [2025-04-30 10:39:13,344 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:39:13,344 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 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 29 [2025-04-30 10:39:13,344 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:13,345 INFO L225 Difference]: With dead ends: 167 [2025-04-30 10:39:13,345 INFO L226 Difference]: Without dead ends: 167 [2025-04-30 10:39:13,346 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 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-04-30 10:39:13,346 INFO L437 NwaCegarLoop]: 138 mSDtfsCounter, 24 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:13,346 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 991 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 540 Invalid, 0 Unknown, 176 Unchecked, 0.3s Time] [2025-04-30 10:39:13,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-04-30 10:39:13,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 160. [2025-04-30 10:39:13,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 91 states have (on average 1.835164835164835) internal successors, (167), 153 states have internal predecessors, (167), 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-04-30 10:39:13,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 177 transitions. [2025-04-30 10:39:13,351 INFO L79 Accepts]: Start accepts. Automaton has 160 states and 177 transitions. Word has length 29 [2025-04-30 10:39:13,351 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:13,351 INFO L485 AbstractCegarLoop]: Abstraction has 160 states and 177 transitions. [2025-04-30 10:39:13,351 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 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-04-30 10:39:13,351 INFO L278 IsEmpty]: Start isEmpty. Operand 160 states and 177 transitions. [2025-04-30 10:39:13,351 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-30 10:39:13,351 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:13,351 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, 1] [2025-04-30 10:39:13,359 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-04-30 10:39:13,559 WARN L466 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-04-30 10:39:13,559 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:13,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:13,559 INFO L85 PathProgramCache]: Analyzing trace with hash 2035817355, now seen corresponding path program 1 times [2025-04-30 10:39:13,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:13,559 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360280810] [2025-04-30 10:39:13,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:13,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:13,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-30 10:39:13,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:39:13,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:13,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:13,665 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:39:13,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:13,665 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360280810] [2025-04-30 10:39:13,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360280810] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:13,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:39:13,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:39:13,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779726827] [2025-04-30 10:39:13,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:13,669 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:39:13,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:13,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:39:13,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:39:13,669 INFO L87 Difference]: Start difference. First operand 160 states and 177 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-04-30 10:39:13,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:13,846 INFO L93 Difference]: Finished difference Result 159 states and 176 transitions. [2025-04-30 10:39:13,847 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:39:13,847 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 30 [2025-04-30 10:39:13,847 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:13,848 INFO L225 Difference]: With dead ends: 159 [2025-04-30 10:39:13,848 INFO L226 Difference]: Without dead ends: 159 [2025-04-30 10:39:13,848 INFO L436 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-04-30 10:39:13,848 INFO L437 NwaCegarLoop]: 142 mSDtfsCounter, 7 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:13,849 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 518 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:39:13,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-04-30 10:39:13,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-04-30 10:39:13,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 91 states have (on average 1.8241758241758241) internal successors, (166), 152 states have internal predecessors, (166), 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-04-30 10:39:13,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 176 transitions. [2025-04-30 10:39:13,853 INFO L79 Accepts]: Start accepts. Automaton has 159 states and 176 transitions. Word has length 30 [2025-04-30 10:39:13,853 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:13,853 INFO L485 AbstractCegarLoop]: Abstraction has 159 states and 176 transitions. [2025-04-30 10:39:13,853 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-04-30 10:39:13,853 INFO L278 IsEmpty]: Start isEmpty. Operand 159 states and 176 transitions. [2025-04-30 10:39:13,855 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-30 10:39:13,855 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:13,855 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, 1] [2025-04-30 10:39:13,855 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:39:13,855 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:13,856 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:13,856 INFO L85 PathProgramCache]: Analyzing trace with hash 2035817356, now seen corresponding path program 1 times [2025-04-30 10:39:13,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:13,856 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141526552] [2025-04-30 10:39:13,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:13,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:13,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-30 10:39:13,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:39:13,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:13,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:14,016 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:39:14,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:14,016 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141526552] [2025-04-30 10:39:14,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141526552] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:14,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:39:14,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:39:14,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393116790] [2025-04-30 10:39:14,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:14,017 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:39:14,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:14,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:39:14,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:39:14,018 INFO L87 Difference]: Start difference. First operand 159 states and 176 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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-04-30 10:39:14,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:14,199 INFO L93 Difference]: Finished difference Result 158 states and 175 transitions. [2025-04-30 10:39:14,200 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:39:14,200 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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 30 [2025-04-30 10:39:14,200 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:14,201 INFO L225 Difference]: With dead ends: 158 [2025-04-30 10:39:14,201 INFO L226 Difference]: Without dead ends: 158 [2025-04-30 10:39:14,201 INFO L436 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-04-30 10:39:14,201 INFO L437 NwaCegarLoop]: 141 mSDtfsCounter, 6 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:14,201 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 543 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:39:14,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-04-30 10:39:14,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-04-30 10:39:14,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 91 states have (on average 1.8131868131868132) internal successors, (165), 151 states have internal predecessors, (165), 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-04-30 10:39:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 175 transitions. [2025-04-30 10:39:14,205 INFO L79 Accepts]: Start accepts. Automaton has 158 states and 175 transitions. Word has length 30 [2025-04-30 10:39:14,205 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:14,205 INFO L485 AbstractCegarLoop]: Abstraction has 158 states and 175 transitions. [2025-04-30 10:39:14,205 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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-04-30 10:39:14,205 INFO L278 IsEmpty]: Start isEmpty. Operand 158 states and 175 transitions. [2025-04-30 10:39:14,207 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-30 10:39:14,207 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:14,207 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, 1] [2025-04-30 10:39:14,207 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:39:14,207 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:14,208 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:14,208 INFO L85 PathProgramCache]: Analyzing trace with hash -659736960, now seen corresponding path program 1 times [2025-04-30 10:39:14,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:14,208 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652867826] [2025-04-30 10:39:14,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:14,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:14,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-30 10:39:14,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-30 10:39:14,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:14,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:14,290 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-30 10:39:14,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:14,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652867826] [2025-04-30 10:39:14,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652867826] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:14,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62562724] [2025-04-30 10:39:14,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:14,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:14,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:14,293 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:39:14,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:39:14,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-30 10:39:14,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-30 10:39:14,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:14,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:14,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:39:14,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-30 10:39:14,431 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:39:14,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62562724] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:14,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:39:14,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-04-30 10:39:14,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119554037] [2025-04-30 10:39:14,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:14,432 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:39:14,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:14,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:39:14,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:39:14,432 INFO L87 Difference]: Start difference. First operand 158 states and 175 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-04-30 10:39:14,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:14,443 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2025-04-30 10:39:14,443 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:39:14,443 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 41 [2025-04-30 10:39:14,444 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:14,444 INFO L225 Difference]: With dead ends: 140 [2025-04-30 10:39:14,444 INFO L226 Difference]: Without dead ends: 140 [2025-04-30 10:39:14,444 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 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-04-30 10:39:14,444 INFO L437 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:14,445 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 286 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:39:14,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-04-30 10:39:14,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-04-30 10:39:14,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 78 states have (on average 1.8205128205128205) internal successors, (142), 135 states have internal predecessors, (142), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:14,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2025-04-30 10:39:14,449 INFO L79 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 41 [2025-04-30 10:39:14,449 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:14,449 INFO L485 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2025-04-30 10:39:14,449 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-04-30 10:39:14,449 INFO L278 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2025-04-30 10:39:14,449 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-30 10:39:14,450 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:14,451 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] [2025-04-30 10:39:14,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-30 10:39:14,651 WARN L466 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-04-30 10:39:14,651 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:14,651 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:14,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1278450541, now seen corresponding path program 1 times [2025-04-30 10:39:14,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:14,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855401035] [2025-04-30 10:39:14,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:14,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:14,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:39:14,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:39:14,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:14,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:15,066 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:39:15,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:15,067 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855401035] [2025-04-30 10:39:15,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855401035] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:15,067 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565819105] [2025-04-30 10:39:15,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:15,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:15,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:15,069 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:39:15,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-30 10:39:15,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:39:15,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:39:15,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:15,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:15,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-30 10:39:15,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:15,219 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:39:15,228 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:39:15,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:39:15,271 INFO L354 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-04-30 10:39:15,316 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:39:15,320 WARN L871 $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-04-30 10:39:15,344 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-30 10:39:15,345 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-30 10:39:15,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:39:15,470 INFO L354 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 11 treesize of output 7 [2025-04-30 10:39:15,478 WARN L871 $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-04-30 10:39:15,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:39:15,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:39:15,538 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-30 10:39:15,538 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2025-04-30 10:39:15,546 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 21 not checked. [2025-04-30 10:39:15,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:15,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565819105] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:15,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:39:15,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2025-04-30 10:39:15,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162284317] [2025-04-30 10:39:15,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:15,607 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-30 10:39:15,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:15,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-30 10:39:15,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=288, Unknown=2, NotChecked=70, Total=420 [2025-04-30 10:39:15,608 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand has 20 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 4 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-30 10:39:16,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:16,135 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2025-04-30 10:39:16,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:39:16,136 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 4 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2025-04-30 10:39:16,136 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:16,137 INFO L225 Difference]: With dead ends: 149 [2025-04-30 10:39:16,137 INFO L226 Difference]: Without dead ends: 149 [2025-04-30 10:39:16,137 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=423, Unknown=2, NotChecked=86, Total=600 [2025-04-30 10:39:16,138 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 423 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 302 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:16,138 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 512 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 668 Invalid, 0 Unknown, 302 Unchecked, 0.4s Time] [2025-04-30 10:39:16,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-04-30 10:39:16,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 130. [2025-04-30 10:39:16,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 78 states have (on average 1.6923076923076923) internal successors, (132), 125 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:16,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2025-04-30 10:39:16,142 INFO L79 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 43 [2025-04-30 10:39:16,143 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:16,143 INFO L485 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2025-04-30 10:39:16,143 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 4 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-30 10:39:16,143 INFO L278 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2025-04-30 10:39:16,144 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-30 10:39:16,144 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:16,144 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] [2025-04-30 10:39:16,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-30 10:39:16,348 WARN L466 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-04-30 10:39:16,348 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:16,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:16,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1278450542, now seen corresponding path program 1 times [2025-04-30 10:39:16,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:16,349 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819233803] [2025-04-30 10:39:16,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:16,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:16,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:39:16,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:39:16,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:16,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:16,740 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-30 10:39:16,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:16,740 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819233803] [2025-04-30 10:39:16,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819233803] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:16,740 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552881197] [2025-04-30 10:39:16,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:16,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:16,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:16,742 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-04-30 10:39:16,744 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-04-30 10:39:16,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:39:16,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:39:16,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:16,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:16,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-30 10:39:16,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:16,886 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:39:16,908 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:39:16,915 WARN L871 $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-04-30 10:39:16,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:39:16,945 INFO L354 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-04-30 10:39:16,961 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:39:17,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:39:17,002 INFO L354 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-04-30 10:39:17,068 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:39:17,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:39:17,106 INFO L354 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-04-30 10:39:17,122 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-30 10:39:17,122 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:39:17,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552881197] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:17,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:39:17,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2025-04-30 10:39:17,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960661999] [2025-04-30 10:39:17,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:17,122 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:39:17,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:17,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:39:17,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=169, Unknown=1, NotChecked=26, Total=240 [2025-04-30 10:39:17,123 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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-04-30 10:39:17,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:17,265 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2025-04-30 10:39:17,265 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:39:17,265 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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 43 [2025-04-30 10:39:17,265 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:17,266 INFO L225 Difference]: With dead ends: 124 [2025-04-30 10:39:17,266 INFO L226 Difference]: Without dead ends: 124 [2025-04-30 10:39:17,266 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=194, Unknown=1, NotChecked=28, Total=272 [2025-04-30 10:39:17,266 INFO L437 NwaCegarLoop]: 90 mSDtfsCounter, 52 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:17,266 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 281 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 193 Invalid, 0 Unknown, 164 Unchecked, 0.1s Time] [2025-04-30 10:39:17,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-04-30 10:39:17,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2025-04-30 10:39:17,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 78 states have (on average 1.6025641025641026) internal successors, (125), 118 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:17,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2025-04-30 10:39:17,269 INFO L79 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 43 [2025-04-30 10:39:17,269 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:17,269 INFO L485 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2025-04-30 10:39:17,269 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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-04-30 10:39:17,269 INFO L278 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2025-04-30 10:39:17,269 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-30 10:39:17,269 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:17,269 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] [2025-04-30 10:39:17,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-30 10:39:17,469 WARN L466 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-04-30 10:39:17,470 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:17,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:17,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1449903938, now seen corresponding path program 1 times [2025-04-30 10:39:17,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:17,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616593485] [2025-04-30 10:39:17,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:17,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:17,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-30 10:39:17,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:39:17,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:17,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:17,760 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:39:17,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:17,760 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616593485] [2025-04-30 10:39:17,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616593485] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:17,760 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449893783] [2025-04-30 10:39:17,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:17,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:17,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:17,764 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-04-30 10:39:17,766 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-04-30 10:39:17,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-30 10:39:18,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:39:18,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:18,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:18,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-30 10:39:18,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:18,180 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:39:18,184 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:39:18,350 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:39:18,361 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:39:18,362 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-30 10:39:18,464 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-30 10:39:18,470 WARN L871 $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-04-30 10:39:18,501 INFO L325 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-04-30 10:39:18,502 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2025-04-30 10:39:18,508 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-04-30 10:39:18,511 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2025-04-30 10:39:18,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:18,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449893783] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:18,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:39:18,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 27 [2025-04-30 10:39:18,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166302076] [2025-04-30 10:39:18,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:18,574 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-30 10:39:18,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:18,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-30 10:39:18,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=682, Unknown=1, NotChecked=52, Total=812 [2025-04-30 10:39:18,575 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand has 28 states, 27 states have (on average 2.814814814814815) internal successors, (76), 24 states have internal predecessors, (76), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-30 10:39:19,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:19,328 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2025-04-30 10:39:19,328 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:39:19,328 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.814814814814815) internal successors, (76), 24 states have internal predecessors, (76), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 46 [2025-04-30 10:39:19,328 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:19,329 INFO L225 Difference]: With dead ends: 167 [2025-04-30 10:39:19,329 INFO L226 Difference]: Without dead ends: 167 [2025-04-30 10:39:19,330 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=1327, Unknown=1, NotChecked=74, Total=1560 [2025-04-30 10:39:19,330 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 378 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:19,330 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 766 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1328 Invalid, 0 Unknown, 173 Unchecked, 0.6s Time] [2025-04-30 10:39:19,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-04-30 10:39:19,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 130. [2025-04-30 10:39:19,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 85 states have (on average 1.6705882352941177) internal successors, (142), 125 states have internal predecessors, (142), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:19,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2025-04-30 10:39:19,333 INFO L79 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 46 [2025-04-30 10:39:19,333 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:19,333 INFO L485 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2025-04-30 10:39:19,333 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.814814814814815) internal successors, (76), 24 states have internal predecessors, (76), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-30 10:39:19,333 INFO L278 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2025-04-30 10:39:19,334 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-30 10:39:19,334 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:19,334 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] [2025-04-30 10:39:19,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-30 10:39:19,534 WARN L466 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-04-30 10:39:19,535 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:19,535 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:19,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1449903937, now seen corresponding path program 1 times [2025-04-30 10:39:19,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:19,535 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747118321] [2025-04-30 10:39:19,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:19,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:19,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-30 10:39:19,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:39:19,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:19,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:39:19,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:19,952 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747118321] [2025-04-30 10:39:19,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747118321] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:19,952 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775642805] [2025-04-30 10:39:19,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:19,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:19,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:19,957 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-04-30 10:39:19,961 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-04-30 10:39:20,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-30 10:39:20,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:39:20,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:20,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:20,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-04-30 10:39:20,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:20,474 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:39:20,762 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-30 10:39:20,764 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-30 10:39:20,797 WARN L871 $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_4| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0))) is different from true [2025-04-30 10:39:20,845 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-30 10:39:20,846 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-04-30 10:39:20,848 INFO L354 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-04-30 10:39:20,900 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-04-30 10:39:20,938 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 14 not checked. [2025-04-30 10:39:20,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:21,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775642805] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:21,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:39:21,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 33 [2025-04-30 10:39:21,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31719215] [2025-04-30 10:39:21,076 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:21,077 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-30 10:39:21,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:21,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-30 10:39:21,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1223, Unknown=1, NotChecked=70, Total=1406 [2025-04-30 10:39:21,078 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand has 34 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 29 states have internal predecessors, (79), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-30 10:39:22,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:22,054 INFO L93 Difference]: Finished difference Result 175 states and 185 transitions. [2025-04-30 10:39:22,054 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-30 10:39:22,054 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 29 states have internal predecessors, (79), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 46 [2025-04-30 10:39:22,054 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:22,055 INFO L225 Difference]: With dead ends: 175 [2025-04-30 10:39:22,055 INFO L226 Difference]: Without dead ends: 175 [2025-04-30 10:39:22,056 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=230, Invalid=2529, Unknown=1, NotChecked=102, Total=2862 [2025-04-30 10:39:22,056 INFO L437 NwaCegarLoop]: 80 mSDtfsCounter, 353 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 1716 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 1898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 178 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:22,056 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 1617 Invalid, 1898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1716 Invalid, 0 Unknown, 178 Unchecked, 0.7s Time] [2025-04-30 10:39:22,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-04-30 10:39:22,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 138. [2025-04-30 10:39:22,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 92 states have (on average 1.5978260869565217) internal successors, (147), 132 states have internal predecessors, (147), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:22,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 153 transitions. [2025-04-30 10:39:22,059 INFO L79 Accepts]: Start accepts. Automaton has 138 states and 153 transitions. Word has length 46 [2025-04-30 10:39:22,059 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:22,059 INFO L485 AbstractCegarLoop]: Abstraction has 138 states and 153 transitions. [2025-04-30 10:39:22,059 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 29 states have internal predecessors, (79), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-30 10:39:22,059 INFO L278 IsEmpty]: Start isEmpty. Operand 138 states and 153 transitions. [2025-04-30 10:39:22,060 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-30 10:39:22,060 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:22,060 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-04-30 10:39:22,068 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-04-30 10:39:22,260 WARN L466 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-04-30 10:39:22,261 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:22,261 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:22,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1997343080, now seen corresponding path program 1 times [2025-04-30 10:39:22,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:22,261 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189166208] [2025-04-30 10:39:22,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:22,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:22,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-30 10:39:22,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-30 10:39:22,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:22,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:22,303 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-30 10:39:22,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:22,304 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189166208] [2025-04-30 10:39:22,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189166208] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:22,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:39:22,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:39:22,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500383676] [2025-04-30 10:39:22,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:22,304 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:39:22,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:22,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:39:22,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:39:22,305 INFO L87 Difference]: Start difference. First operand 138 states and 153 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-04-30 10:39:22,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:22,315 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2025-04-30 10:39:22,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:39:22,315 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 47 [2025-04-30 10:39:22,315 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:22,316 INFO L225 Difference]: With dead ends: 134 [2025-04-30 10:39:22,316 INFO L226 Difference]: Without dead ends: 134 [2025-04-30 10:39:22,316 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:39:22,316 INFO L437 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 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-04-30 10:39:22,317 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:39:22,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-04-30 10:39:22,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-04-30 10:39:22,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 88 states have (on average 1.5454545454545454) internal successors, (136), 128 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-04-30 10:39:22,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2025-04-30 10:39:22,321 INFO L79 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 47 [2025-04-30 10:39:22,321 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:22,321 INFO L485 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2025-04-30 10:39:22,321 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-04-30 10:39:22,321 INFO L278 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2025-04-30 10:39:22,321 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-30 10:39:22,321 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:22,321 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-04-30 10:39:22,321 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-30 10:39:22,322 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:22,322 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:22,322 INFO L85 PathProgramCache]: Analyzing trace with hash 404114297, now seen corresponding path program 1 times [2025-04-30 10:39:22,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:22,322 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229890854] [2025-04-30 10:39:22,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:22,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:22,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-30 10:39:22,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-30 10:39:22,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:22,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:22,393 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-30 10:39:22,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:22,393 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229890854] [2025-04-30 10:39:22,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229890854] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:22,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:39:22,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:39:22,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295884973] [2025-04-30 10:39:22,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:22,394 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:39:22,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:22,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:39:22,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:39:22,395 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-04-30 10:39:22,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:22,519 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2025-04-30 10:39:22,519 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:39:22,520 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-04-30 10:39:22,520 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:22,520 INFO L225 Difference]: With dead ends: 128 [2025-04-30 10:39:22,520 INFO L226 Difference]: Without dead ends: 128 [2025-04-30 10:39:22,520 INFO L436 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-04-30 10:39:22,521 INFO L437 NwaCegarLoop]: 90 mSDtfsCounter, 33 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:22,521 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 320 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:39:22,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-04-30 10:39:22,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-04-30 10:39:22,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 122 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-04-30 10:39:22,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2025-04-30 10:39:22,524 INFO L79 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 49 [2025-04-30 10:39:22,524 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:22,524 INFO L485 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2025-04-30 10:39:22,524 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-04-30 10:39:22,524 INFO L278 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2025-04-30 10:39:22,525 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-30 10:39:22,525 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:22,525 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-04-30 10:39:22,525 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:39:22,525 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:22,525 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:22,525 INFO L85 PathProgramCache]: Analyzing trace with hash 404114298, now seen corresponding path program 1 times [2025-04-30 10:39:22,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:22,525 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795842034] [2025-04-30 10:39:22,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:22,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:22,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-30 10:39:22,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-30 10:39:22,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:22,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:22,614 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-30 10:39:22,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:22,615 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795842034] [2025-04-30 10:39:22,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795842034] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:22,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:39:22,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:39:22,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539824516] [2025-04-30 10:39:22,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:22,616 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:39:22,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:22,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:39:22,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:39:22,617 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-04-30 10:39:22,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:22,633 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions. [2025-04-30 10:39:22,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:39:22,633 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 49 [2025-04-30 10:39:22,633 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:22,634 INFO L225 Difference]: With dead ends: 131 [2025-04-30 10:39:22,634 INFO L226 Difference]: Without dead ends: 131 [2025-04-30 10:39:22,634 INFO L436 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-04-30 10:39:22,634 INFO L437 NwaCegarLoop]: 120 mSDtfsCounter, 73 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:22,634 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 274 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:39:22,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-04-30 10:39:22,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2025-04-30 10:39:22,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 87 states have (on average 1.471264367816092) internal successors, (128), 121 states have internal predecessors, (128), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:22,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 134 transitions. [2025-04-30 10:39:22,638 INFO L79 Accepts]: Start accepts. Automaton has 127 states and 134 transitions. Word has length 49 [2025-04-30 10:39:22,638 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:22,638 INFO L485 AbstractCegarLoop]: Abstraction has 127 states and 134 transitions. [2025-04-30 10:39:22,638 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-04-30 10:39:22,638 INFO L278 IsEmpty]: Start isEmpty. Operand 127 states and 134 transitions. [2025-04-30 10:39:22,639 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-30 10:39:22,639 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:22,639 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, 1, 1] [2025-04-30 10:39:22,639 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-30 10:39:22,639 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:22,639 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:22,639 INFO L85 PathProgramCache]: Analyzing trace with hash 397896661, now seen corresponding path program 1 times [2025-04-30 10:39:22,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:22,640 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088973252] [2025-04-30 10:39:22,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:22,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:22,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-30 10:39:22,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-30 10:39:22,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:22,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:22,727 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-30 10:39:22,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:22,727 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088973252] [2025-04-30 10:39:22,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088973252] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:22,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:39:22,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:39:22,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749579287] [2025-04-30 10:39:22,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:22,728 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:39:22,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:22,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:39:22,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:39:22,729 INFO L87 Difference]: Start difference. First operand 127 states and 134 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-04-30 10:39:22,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:22,746 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2025-04-30 10:39:22,747 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:39:22,747 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 49 [2025-04-30 10:39:22,747 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:22,747 INFO L225 Difference]: With dead ends: 128 [2025-04-30 10:39:22,747 INFO L226 Difference]: Without dead ends: 128 [2025-04-30 10:39:22,747 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:39:22,748 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 66 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:22,748 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 275 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:39:22,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-04-30 10:39:22,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2025-04-30 10:39:22,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 86 states have (on average 1.441860465116279) internal successors, (124), 118 states have internal predecessors, (124), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:22,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2025-04-30 10:39:22,752 INFO L79 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 49 [2025-04-30 10:39:22,752 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:22,752 INFO L485 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2025-04-30 10:39:22,752 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-04-30 10:39:22,752 INFO L278 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2025-04-30 10:39:22,752 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-30 10:39:22,752 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:22,752 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] [2025-04-30 10:39:22,753 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-30 10:39:22,753 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:22,753 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:22,753 INFO L85 PathProgramCache]: Analyzing trace with hash -550099359, now seen corresponding path program 1 times [2025-04-30 10:39:22,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:22,753 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149446826] [2025-04-30 10:39:22,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:22,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:22,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-30 10:39:22,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:39:22,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:22,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:22,805 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-30 10:39:22,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:22,806 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149446826] [2025-04-30 10:39:22,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149446826] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:22,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:39:22,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:39:22,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83306518] [2025-04-30 10:39:22,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:22,806 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:39:22,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:22,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:39:22,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:39:22,807 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-04-30 10:39:22,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:22,882 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2025-04-30 10:39:22,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:39:22,882 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 50 [2025-04-30 10:39:22,883 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:22,884 INFO L225 Difference]: With dead ends: 123 [2025-04-30 10:39:22,884 INFO L226 Difference]: Without dead ends: 123 [2025-04-30 10:39:22,884 INFO L436 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-04-30 10:39:22,885 INFO L437 NwaCegarLoop]: 116 mSDtfsCounter, 2 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:22,886 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 244 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:39:22,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-04-30 10:39:22,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-04-30 10:39:22,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 86 states have (on average 1.430232558139535) internal successors, (123), 117 states have internal predecessors, (123), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:22,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2025-04-30 10:39:22,888 INFO L79 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 50 [2025-04-30 10:39:22,888 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:22,888 INFO L485 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2025-04-30 10:39:22,889 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-04-30 10:39:22,889 INFO L278 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2025-04-30 10:39:22,889 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-30 10:39:22,889 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:22,889 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] [2025-04-30 10:39:22,889 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-30 10:39:22,889 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:22,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:22,890 INFO L85 PathProgramCache]: Analyzing trace with hash -550099358, now seen corresponding path program 1 times [2025-04-30 10:39:22,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:22,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932270122] [2025-04-30 10:39:22,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:22,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:22,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-30 10:39:22,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:39:22,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:22,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:23,363 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:39:23,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:23,364 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932270122] [2025-04-30 10:39:23,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932270122] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:23,364 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638618251] [2025-04-30 10:39:23,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:23,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:23,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:23,366 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-04-30 10:39:23,367 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-04-30 10:39:23,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-30 10:39:23,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:39:23,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:23,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:23,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-30 10:39:23,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:23,578 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-30 10:39:23,578 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:39:23,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638618251] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:23,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:39:23,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [17] total 19 [2025-04-30 10:39:23,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808293072] [2025-04-30 10:39:23,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:23,579 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:39:23,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:23,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:39:23,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:39:23,580 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-04-30 10:39:23,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:23,634 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2025-04-30 10:39:23,634 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:39:23,635 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 50 [2025-04-30 10:39:23,635 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:23,635 INFO L225 Difference]: With dead ends: 122 [2025-04-30 10:39:23,635 INFO L226 Difference]: Without dead ends: 122 [2025-04-30 10:39:23,635 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:39:23,636 INFO L437 NwaCegarLoop]: 115 mSDtfsCounter, 2 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:23,636 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 282 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:39:23,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-04-30 10:39:23,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-04-30 10:39:23,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 116 states have internal predecessors, (122), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:23,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2025-04-30 10:39:23,638 INFO L79 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 50 [2025-04-30 10:39:23,638 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:23,638 INFO L485 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2025-04-30 10:39:23,638 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-04-30 10:39:23,638 INFO L278 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2025-04-30 10:39:23,638 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-30 10:39:23,639 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:23,639 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-04-30 10:39:23,646 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-04-30 10:39:23,839 WARN L466 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-04-30 10:39:23,839 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:23,840 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:23,840 INFO L85 PathProgramCache]: Analyzing trace with hash 126789083, now seen corresponding path program 1 times [2025-04-30 10:39:23,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:23,840 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334661084] [2025-04-30 10:39:23,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:23,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:23,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:39:23,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:39:23,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:23,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:23,976 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:39:23,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:23,977 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334661084] [2025-04-30 10:39:23,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334661084] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:23,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:39:23,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:39:23,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952788739] [2025-04-30 10:39:23,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:23,977 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:39:23,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:23,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:39:23,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:39:23,978 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-04-30 10:39:24,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:24,095 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2025-04-30 10:39:24,095 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:39:24,096 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 51 [2025-04-30 10:39:24,096 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:24,096 INFO L225 Difference]: With dead ends: 116 [2025-04-30 10:39:24,096 INFO L226 Difference]: Without dead ends: 116 [2025-04-30 10:39:24,096 INFO L436 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-04-30 10:39:24,097 INFO L437 NwaCegarLoop]: 88 mSDtfsCounter, 26 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:24,098 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 324 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:39:24,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-04-30 10:39:24,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-04-30 10:39:24,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 110 states have internal predecessors, (116), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:24,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2025-04-30 10:39:24,101 INFO L79 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 51 [2025-04-30 10:39:24,101 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:24,101 INFO L485 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2025-04-30 10:39:24,101 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-04-30 10:39:24,101 INFO L278 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2025-04-30 10:39:24,101 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-30 10:39:24,101 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:24,101 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-04-30 10:39:24,101 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-30 10:39:24,102 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:24,102 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:24,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1585224477, now seen corresponding path program 1 times [2025-04-30 10:39:24,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:24,102 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263061519] [2025-04-30 10:39:24,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:24,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:24,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:39:24,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:39:24,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:24,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:25,097 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:39:25,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:25,097 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263061519] [2025-04-30 10:39:25,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263061519] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:25,097 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893995466] [2025-04-30 10:39:25,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:25,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:25,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:25,099 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-04-30 10:39:25,100 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-04-30 10:39:25,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:39:25,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:39:25,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:25,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:25,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-04-30 10:39:25,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:25,333 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:39:25,471 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:39:25,471 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-30 10:39:25,548 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:39:25,599 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:39:25,687 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:39:25,728 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2025-04-30 10:39:25,847 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 17 [2025-04-30 10:39:25,850 INFO L354 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-04-30 10:39:25,991 WARN L871 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) (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-04-30 10:39:26,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:39:26,014 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 34 [2025-04-30 10:39:26,036 INFO L325 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2025-04-30 10:39:26,036 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 57 [2025-04-30 10:39:26,126 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 49 [2025-04-30 10:39:26,266 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2025-04-30 10:39:26,422 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-04-30 10:39:26,422 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:26,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893995466] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:26,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:39:26,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 48 [2025-04-30 10:39:26,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962063493] [2025-04-30 10:39:26,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:26,500 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-04-30 10:39:26,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:26,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-04-30 10:39:26,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2200, Unknown=1, NotChecked=94, Total=2450 [2025-04-30 10:39:26,502 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand has 49 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 42 states have internal predecessors, (87), 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-04-30 10:39:28,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:28,044 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2025-04-30 10:39:28,045 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-30 10:39:28,045 INFO L79 Accepts]: Start accepts. Automaton has has 49 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 42 states have internal predecessors, (87), 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 53 [2025-04-30 10:39:28,045 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:28,046 INFO L225 Difference]: With dead ends: 117 [2025-04-30 10:39:28,046 INFO L226 Difference]: Without dead ends: 117 [2025-04-30 10:39:28,047 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=323, Invalid=4102, Unknown=1, NotChecked=130, Total=4556 [2025-04-30 10:39:28,047 INFO L437 NwaCegarLoop]: 68 mSDtfsCounter, 153 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 1985 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 2122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:28,047 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1488 Invalid, 2122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1985 Invalid, 0 Unknown, 120 Unchecked, 0.9s Time] [2025-04-30 10:39:28,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-04-30 10:39:28,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2025-04-30 10:39:28,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 109 states have internal predecessors, (115), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:28,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2025-04-30 10:39:28,049 INFO L79 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 53 [2025-04-30 10:39:28,049 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:28,049 INFO L485 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2025-04-30 10:39:28,050 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 42 states have internal predecessors, (87), 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-04-30 10:39:28,050 INFO L278 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2025-04-30 10:39:28,050 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-30 10:39:28,050 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:28,050 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-04-30 10:39:28,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-30 10:39:28,250 WARN L466 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-04-30 10:39:28,251 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:28,251 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:28,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1585224478, now seen corresponding path program 1 times [2025-04-30 10:39:28,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:28,251 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68998034] [2025-04-30 10:39:28,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:28,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:28,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:39:28,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:39:28,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:28,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:29,631 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:39:29,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:29,631 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68998034] [2025-04-30 10:39:29,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68998034] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:29,631 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813432170] [2025-04-30 10:39:29,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:29,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:29,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:29,633 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-04-30 10:39:29,634 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-04-30 10:39:29,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:39:30,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:39:30,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:30,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:30,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 120 conjuncts are in the unsatisfiable core [2025-04-30 10:39:30,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:30,061 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:39:30,064 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:39:30,284 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:39:30,284 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-30 10:39:30,292 INFO L354 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-04-30 10:39:30,396 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:39:30,402 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:39:30,493 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:39:30,498 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:39:30,628 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:39:30,638 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:39:30,699 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2025-04-30 10:39:30,709 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-04-30 10:39:30,925 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 22 [2025-04-30 10:39:30,933 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2025-04-30 10:39:30,940 INFO L354 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-04-30 10:39:30,944 INFO L354 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-04-30 10:39:31,147 WARN L871 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6| Int)) (<= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_6|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2025-04-30 10:39:31,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:39:31,184 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 41 [2025-04-30 10:39:31,200 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-30 10:39:31,201 INFO L354 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-04-30 10:39:31,205 INFO L354 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-04-30 10:39:31,210 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2025-04-30 10:39:31,285 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 46 [2025-04-30 10:39:31,297 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:39:31,297 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2025-04-30 10:39:31,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:39:31,520 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:39:31,521 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 24 [2025-04-30 10:39:31,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:39:31,528 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:39:31,528 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2025-04-30 10:39:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-04-30 10:39:31,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:32,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813432170] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:32,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:39:32,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 53 [2025-04-30 10:39:32,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150524419] [2025-04-30 10:39:32,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:32,276 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-30 10:39:32,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:32,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-30 10:39:32,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=3488, Unknown=1, NotChecked=118, Total=3782 [2025-04-30 10:39:32,277 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand has 54 states, 50 states have (on average 1.76) internal successors, (88), 47 states have internal predecessors, (88), 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-04-30 10:39:35,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:35,178 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2025-04-30 10:39:35,178 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-30 10:39:35,178 INFO L79 Accepts]: Start accepts. Automaton has has 54 states, 50 states have (on average 1.76) internal successors, (88), 47 states have internal predecessors, (88), 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 53 [2025-04-30 10:39:35,178 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:35,179 INFO L225 Difference]: With dead ends: 115 [2025-04-30 10:39:35,179 INFO L226 Difference]: Without dead ends: 115 [2025-04-30 10:39:35,180 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1319 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=390, Invalid=6923, Unknown=1, NotChecked=168, Total=7482 [2025-04-30 10:39:35,181 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 110 mSDsluCounter, 1622 mSDsCounter, 0 mSdLazyCounter, 2708 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 2836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:35,181 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1688 Invalid, 2836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2708 Invalid, 0 Unknown, 118 Unchecked, 1.4s Time] [2025-04-30 10:39:35,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-04-30 10:39:35,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2025-04-30 10:39:35,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 108 states have internal predecessors, (114), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:35,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2025-04-30 10:39:35,183 INFO L79 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 53 [2025-04-30 10:39:35,183 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:35,183 INFO L485 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2025-04-30 10:39:35,183 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 50 states have (on average 1.76) internal successors, (88), 47 states have internal predecessors, (88), 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-04-30 10:39:35,184 INFO L278 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2025-04-30 10:39:35,184 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-30 10:39:35,184 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:35,184 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-04-30 10:39:35,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-30 10:39:35,384 WARN L466 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-04-30 10:39:35,385 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:35,385 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:35,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1312664961, now seen corresponding path program 1 times [2025-04-30 10:39:35,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:35,385 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474141469] [2025-04-30 10:39:35,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:35,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:35,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-30 10:39:35,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-30 10:39:35,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:35,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:35,519 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-04-30 10:39:35,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:35,519 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474141469] [2025-04-30 10:39:35,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474141469] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:35,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:39:35,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:39:35,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936221585] [2025-04-30 10:39:35,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:35,520 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:39:35,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:35,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:39:35,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:39:35,520 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand has 6 states, 4 states have (on average 8.75) internal successors, (35), 6 states have internal predecessors, (35), 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-04-30 10:39:35,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:35,585 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2025-04-30 10:39:35,585 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:39:35,585 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.75) internal successors, (35), 6 states have internal predecessors, (35), 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 55 [2025-04-30 10:39:35,586 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:35,586 INFO L225 Difference]: With dead ends: 112 [2025-04-30 10:39:35,586 INFO L226 Difference]: Without dead ends: 112 [2025-04-30 10:39:35,586 INFO L436 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-04-30 10:39:35,586 INFO L437 NwaCegarLoop]: 82 mSDtfsCounter, 118 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:35,586 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 171 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:39:35,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-04-30 10:39:35,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-04-30 10:39:35,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 105 states have internal predecessors, (111), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:35,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2025-04-30 10:39:35,589 INFO L79 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 55 [2025-04-30 10:39:35,589 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:35,590 INFO L485 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2025-04-30 10:39:35,590 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.75) internal successors, (35), 6 states have internal predecessors, (35), 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-04-30 10:39:35,590 INFO L278 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2025-04-30 10:39:35,590 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-04-30 10:39:35,590 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:35,590 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] [2025-04-30 10:39:35,590 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-30 10:39:35,591 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:35,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:35,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1249359394, now seen corresponding path program 1 times [2025-04-30 10:39:35,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:35,591 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843652386] [2025-04-30 10:39:35,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:35,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:35,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-30 10:39:35,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-30 10:39:35,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:35,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:35,757 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-30 10:39:35,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:35,757 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843652386] [2025-04-30 10:39:35,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843652386] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:35,757 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19226486] [2025-04-30 10:39:35,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:35,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:35,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:35,759 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-04-30 10:39:35,762 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-04-30 10:39:35,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-30 10:39:35,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-30 10:39:35,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:35,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:35,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-30 10:39:35,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:35,989 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:39:36,056 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-30 10:39:36,068 WARN L871 $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-04-30 10:39:36,091 INFO L325 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-04-30 10:39:36,091 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2025-04-30 10:39:36,106 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-04-30 10:39:36,108 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2025-04-30 10:39:36,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:36,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19226486] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:36,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:39:36,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 15 [2025-04-30 10:39:36,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821152160] [2025-04-30 10:39:36,163 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:36,163 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-30 10:39:36,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:36,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-30 10:39:36,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=211, Unknown=1, NotChecked=28, Total=272 [2025-04-30 10:39:36,163 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand has 16 states, 15 states have (on average 4.4) internal successors, (66), 14 states have internal predecessors, (66), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-30 10:39:36,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:36,509 INFO L93 Difference]: Finished difference Result 137 states and 144 transitions. [2025-04-30 10:39:36,510 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-30 10:39:36,510 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.4) internal successors, (66), 14 states have internal predecessors, (66), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 57 [2025-04-30 10:39:36,510 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:36,510 INFO L225 Difference]: With dead ends: 137 [2025-04-30 10:39:36,510 INFO L226 Difference]: Without dead ends: 137 [2025-04-30 10:39:36,511 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=442, Unknown=1, NotChecked=42, Total=552 [2025-04-30 10:39:36,511 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 89 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:36,511 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 688 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 753 Invalid, 0 Unknown, 130 Unchecked, 0.3s Time] [2025-04-30 10:39:36,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-04-30 10:39:36,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 114. [2025-04-30 10:39:36,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 108 states have internal predecessors, (115), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:36,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2025-04-30 10:39:36,513 INFO L79 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 57 [2025-04-30 10:39:36,514 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:36,514 INFO L485 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2025-04-30 10:39:36,514 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.4) internal successors, (66), 14 states have internal predecessors, (66), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-30 10:39:36,514 INFO L278 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2025-04-30 10:39:36,514 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-04-30 10:39:36,514 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:36,514 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] [2025-04-30 10:39:36,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-30 10:39:36,720 WARN L466 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-04-30 10:39:36,721 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:36,721 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:36,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1249359395, now seen corresponding path program 1 times [2025-04-30 10:39:36,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:36,721 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336073825] [2025-04-30 10:39:36,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:36,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:36,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-30 10:39:36,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-30 10:39:36,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:36,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:37,267 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:39:37,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:37,267 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336073825] [2025-04-30 10:39:37,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336073825] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:37,267 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957815555] [2025-04-30 10:39:37,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:37,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:37,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:37,269 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-04-30 10:39:37,270 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-04-30 10:39:37,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-30 10:39:37,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-30 10:39:37,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:37,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:37,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-30 10:39:37,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:37,478 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:39:37,481 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:39:37,700 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-30 10:39:37,702 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-30 10:39:37,740 WARN L871 $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_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|))) (and (<= .cse0 0) (<= 0 (+ .cse0 4)))))) is different from true [2025-04-30 10:39:37,788 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-30 10:39:37,788 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-04-30 10:39:37,792 INFO L354 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-04-30 10:39:37,949 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-04-30 10:39:37,957 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:39:37,957 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2025-04-30 10:39:38,012 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2025-04-30 10:39:38,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:38,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957815555] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:38,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:39:38,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 32 [2025-04-30 10:39:38,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410493677] [2025-04-30 10:39:38,184 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:38,185 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-30 10:39:38,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:38,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-30 10:39:38,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1149, Unknown=1, NotChecked=68, Total=1332 [2025-04-30 10:39:38,186 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand has 33 states, 30 states have (on average 3.033333333333333) internal successors, (91), 29 states have internal predecessors, (91), 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-04-30 10:39:39,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:39,134 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2025-04-30 10:39:39,134 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:39:39,134 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 3.033333333333333) internal successors, (91), 29 states have internal predecessors, (91), 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 57 [2025-04-30 10:39:39,134 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:39,135 INFO L225 Difference]: With dead ends: 135 [2025-04-30 10:39:39,135 INFO L226 Difference]: Without dead ends: 135 [2025-04-30 10:39:39,135 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=204, Invalid=1961, Unknown=1, NotChecked=90, Total=2256 [2025-04-30 10:39:39,136 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 91 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:39,136 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1102 Invalid, 1740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1599 Invalid, 0 Unknown, 136 Unchecked, 0.7s Time] [2025-04-30 10:39:39,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-04-30 10:39:39,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 116. [2025-04-30 10:39:39,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 92 states have (on average 1.2717391304347827) internal successors, (117), 110 states have internal predecessors, (117), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:39:39,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2025-04-30 10:39:39,138 INFO L79 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 57 [2025-04-30 10:39:39,138 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:39,138 INFO L485 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2025-04-30 10:39:39,139 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 3.033333333333333) internal successors, (91), 29 states have internal predecessors, (91), 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-04-30 10:39:39,139 INFO L278 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2025-04-30 10:39:39,139 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-04-30 10:39:39,139 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:39,139 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] [2025-04-30 10:39:39,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-30 10:39:39,339 WARN L466 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-04-30 10:39:39,340 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:39:39,340 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:39,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1994003285, now seen corresponding path program 1 times [2025-04-30 10:39:39,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:39,340 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986390557] [2025-04-30 10:39:39,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:39,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:39,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-30 10:39:39,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-30 10:39:39,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:39,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:39,529 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:39:39,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:39,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986390557] [2025-04-30 10:39:39,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986390557] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:39,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073193998] [2025-04-30 10:39:39,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:39,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:39,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:39,532 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-04-30 10:39:39,533 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-04-30 10:39:39,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-30 10:39:39,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-30 10:39:39,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:39,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:39,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-30 10:39:39,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:39,895 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:39:39,897 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:39:39,897 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:39:39,936 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:39:39,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:39,982 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:39:39,982 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-04-30 10:39:40,129 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:39:40,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073193998] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:39:40,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:39:40,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 27 [2025-04-30 10:39:40,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594326790] [2025-04-30 10:39:40,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:40,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-30 10:39:40,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:39:40,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-30 10:39:40,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2025-04-30 10:39:40,130 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 24 states have internal predecessors, (85), 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-04-30 10:39:44,155 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:39:48,167 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:39:52,181 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:39:56,220 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:40:00,233 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:40:04,251 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:40:08,262 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:40:08,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:40:08,541 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2025-04-30 10:40:08,541 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-30 10:40:08,541 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 24 states have internal predecessors, (85), 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 58 [2025-04-30 10:40:08,541 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:40:08,542 INFO L225 Difference]: With dead ends: 92 [2025-04-30 10:40:08,542 INFO L226 Difference]: Without dead ends: 92 [2025-04-30 10:40:08,542 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=1049, Unknown=0, NotChecked=0, Total=1190 [2025-04-30 10:40:08,543 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 104 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:40:08,543 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1111 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 534 Invalid, 7 Unknown, 0 Unchecked, 28.3s Time] [2025-04-30 10:40:08,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-04-30 10:40:08,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-04-30 10:40:08,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 86 states have internal predecessors, (91), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:40:08,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2025-04-30 10:40:08,545 INFO L79 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 58 [2025-04-30 10:40:08,546 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:40:08,546 INFO L485 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2025-04-30 10:40:08,546 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 24 states have internal predecessors, (85), 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-04-30 10:40:08,546 INFO L278 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2025-04-30 10:40:08,546 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-04-30 10:40:08,546 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:40:08,546 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-04-30 10:40:08,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-30 10:40:08,747 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:40:08,747 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-04-30 10:40:08,747 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:40:08,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1035652800, now seen corresponding path program 1 times [2025-04-30 10:40:08,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:40:08,747 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398303053] [2025-04-30 10:40:08,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:40:08,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:40:08,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-04-30 10:40:08,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-04-30 10:40:08,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:40:08,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15