./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/list-simple/sll2n_append_equal.c --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/sll2n_append_equal.c -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 2b896c6b554b5c339be469ecfc15ca876d8bd9187b7562287b3d26e3a845c9eb --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:21:28,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:21:28,614 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:21:28,617 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:21:28,617 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:21:28,640 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:21:28,641 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:21:28,641 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:21:28,641 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:21:28,642 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:21:28,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:21:28,642 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:21:28,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:21:28,643 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:21:28,643 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:21:28,643 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:21:28,643 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:21:28,643 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:21:28,643 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:21:28,643 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:21:28,644 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:21:28,644 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:21:28,644 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:21:28,644 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:21:28,644 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:21:28,644 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:21:28,644 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:21:28,644 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:21:28,644 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:21:28,644 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:21:28,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:21:28,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:21:28,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:21:28,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:21:28,645 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:21:28,645 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:21:28,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:21:28,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:21:28,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:21:28,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:21:28,646 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:21:28,646 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:21:28,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:21:28,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:21:28,646 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:21:28,646 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:21:28,646 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 -> 2b896c6b554b5c339be469ecfc15ca876d8bd9187b7562287b3d26e3a845c9eb [2025-04-29 11:21:28,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:21:28,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:21:28,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:21:28,894 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:21:28,895 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:21:28,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_append_equal.c [2025-04-29 11:21:30,110 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8d4e7f1e/6c515c56e6b14727a9753e3a2cacacf4/FLAGadae694da [2025-04-29 11:21:30,329 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:21:30,330 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_append_equal.c [2025-04-29 11:21:30,331 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:21:30,331 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:21:30,338 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8d4e7f1e/6c515c56e6b14727a9753e3a2cacacf4/FLAGadae694da [2025-04-29 11:21:31,111 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8d4e7f1e/6c515c56e6b14727a9753e3a2cacacf4 [2025-04-29 11:21:31,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:21:31,114 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:21:31,115 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:21:31,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:21:31,117 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:21:31,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:21:31" (1/1) ... [2025-04-29 11:21:31,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ba869d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:31, skipping insertion in model container [2025-04-29 11:21:31,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:21:31" (1/1) ... [2025-04-29 11:21:31,131 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:21:31,252 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:21:31,258 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:21:31,285 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:21:31,300 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:21:31,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:31 WrapperNode [2025-04-29 11:21:31,302 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:21:31,303 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:21:31,303 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:21:31,303 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:21:31,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:31" (1/1) ... [2025-04-29 11:21:31,313 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:31" (1/1) ... [2025-04-29 11:21:31,330 INFO L138 Inliner]: procedures = 18, calls = 30, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 111 [2025-04-29 11:21:31,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:21:31,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:21:31,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:21:31,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:21:31,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:31" (1/1) ... [2025-04-29 11:21:31,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:31" (1/1) ... [2025-04-29 11:21:31,342 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:31" (1/1) ... [2025-04-29 11:21:31,358 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [9, 6]. 60 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [0, 1]. The 5 writes are split as follows [4, 1]. [2025-04-29 11:21:31,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:31" (1/1) ... [2025-04-29 11:21:31,358 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:31" (1/1) ... [2025-04-29 11:21:31,364 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:31" (1/1) ... [2025-04-29 11:21:31,364 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:31" (1/1) ... [2025-04-29 11:21:31,366 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:31" (1/1) ... [2025-04-29 11:21:31,368 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:31" (1/1) ... [2025-04-29 11:21:31,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:31" (1/1) ... [2025-04-29 11:21:31,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:21:31,376 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:21:31,376 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:21:31,376 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:21:31,380 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:31" (1/1) ... [2025-04-29 11:21:31,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:21:31,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:21:31,404 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-29 11:21:31,407 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-29 11:21:31,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:21:31,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:21:31,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:21:31,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:21:31,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:21:31,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:21:31,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:21:31,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:21:31,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:21:31,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:21:31,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:21:31,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:21:31,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:21:31,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:21:31,427 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-29 11:21:31,427 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-29 11:21:31,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:21:31,494 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:21:31,495 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:21:31,705 INFO L? ?]: Removed 97 outVars from TransFormulas that were not future-live. [2025-04-29 11:21:31,706 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:21:31,713 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:21:31,713 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-29 11:21:31,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:21:31 BoogieIcfgContainer [2025-04-29 11:21:31,713 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:21:31,715 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:21:31,715 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:21:31,718 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:21:31,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:21:31" (1/3) ... [2025-04-29 11:21:31,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25861527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:21:31, skipping insertion in model container [2025-04-29 11:21:31,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:21:31" (2/3) ... [2025-04-29 11:21:31,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25861527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:21:31, skipping insertion in model container [2025-04-29 11:21:31,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:21:31" (3/3) ... [2025-04-29 11:21:31,720 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.c [2025-04-29 11:21:31,729 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:21:31,731 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_append_equal.c that has 2 procedures, 84 locations, 95 edges, 1 initial locations, 4 loop locations, and 32 error locations. [2025-04-29 11:21:31,760 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:21:31,770 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;@64f2bde4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:21:31,770 INFO L341 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2025-04-29 11:21:31,773 INFO L278 IsEmpty]: Start isEmpty. Operand has 84 states, 48 states have (on average 1.8541666666666667) internal successors, (89), 80 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:21:31,777 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:21:31,777 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:21:31,777 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:21:31,778 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-04-29 11:21:31,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:21:31,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1809687349, now seen corresponding path program 1 times [2025-04-29 11:21:31,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:21:31,787 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929558849] [2025-04-29 11:21:31,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:31,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:21:31,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:21:31,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:21:31,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:31,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:31,955 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-29 11:21:31,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:21:31,956 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929558849] [2025-04-29 11:21:31,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929558849] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:21:31,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:21:31,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:21:31,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896194929] [2025-04-29 11:21:31,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:21:31,961 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:21:31,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:21:31,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:21:31,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:21:31,981 INFO L87 Difference]: Start difference. First operand has 84 states, 48 states have (on average 1.8541666666666667) internal successors, (89), 80 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-29 11:21:32,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:21:32,072 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2025-04-29 11:21:32,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:21:32,074 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2025-04-29 11:21:32,075 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:21:32,080 INFO L225 Difference]: With dead ends: 81 [2025-04-29 11:21:32,081 INFO L226 Difference]: Without dead ends: 77 [2025-04-29 11:21:32,082 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-29 11:21:32,084 INFO L437 NwaCegarLoop]: 81 mSDtfsCounter, 2 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:21:32,086 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 130 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:21:32,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-04-29 11:21:32,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-04-29 11:21:32,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 73 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:21:32,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2025-04-29 11:21:32,112 INFO L79 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 7 [2025-04-29 11:21:32,112 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:21:32,112 INFO L485 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2025-04-29 11:21:32,112 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-29 11:21:32,113 INFO L278 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2025-04-29 11:21:32,113 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:21:32,113 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:21:32,113 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:21:32,113 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:21:32,114 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-04-29 11:21:32,114 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:21:32,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1809687350, now seen corresponding path program 1 times [2025-04-29 11:21:32,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:21:32,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289425498] [2025-04-29 11:21:32,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:32,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:21:32,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:21:32,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:21:32,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:32,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:32,255 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-29 11:21:32,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:21:32,256 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289425498] [2025-04-29 11:21:32,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289425498] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:21:32,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:21:32,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:21:32,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798255932] [2025-04-29 11:21:32,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:21:32,257 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:21:32,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:21:32,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:21:32,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:21:32,257 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-29 11:21:32,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:21:32,314 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2025-04-29 11:21:32,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:21:32,316 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2025-04-29 11:21:32,316 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:21:32,316 INFO L225 Difference]: With dead ends: 75 [2025-04-29 11:21:32,316 INFO L226 Difference]: Without dead ends: 75 [2025-04-29 11:21:32,316 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-29 11:21:32,317 INFO L437 NwaCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:21:32,317 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 126 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:21:32,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-04-29 11:21:32,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-04-29 11:21:32,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 71 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:21:32,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2025-04-29 11:21:32,326 INFO L79 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 7 [2025-04-29 11:21:32,326 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:21:32,326 INFO L485 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2025-04-29 11:21:32,326 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-29 11:21:32,326 INFO L278 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2025-04-29 11:21:32,326 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 11:21:32,327 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:21:32,327 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:21:32,327 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:21:32,327 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-04-29 11:21:32,328 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:21:32,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2001184964, now seen corresponding path program 1 times [2025-04-29 11:21:32,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:21:32,328 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929204716] [2025-04-29 11:21:32,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:32,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:21:32,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:21:32,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:21:32,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:32,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:32,450 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-29 11:21:32,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:21:32,451 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929204716] [2025-04-29 11:21:32,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929204716] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:21:32,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:21:32,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:21:32,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819073277] [2025-04-29 11:21:32,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:21:32,452 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:21:32,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:21:32,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:21:32,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:21:32,454 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:21:32,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:21:32,565 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2025-04-29 11:21:32,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:21:32,566 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-04-29 11:21:32,566 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:21:32,566 INFO L225 Difference]: With dead ends: 74 [2025-04-29 11:21:32,566 INFO L226 Difference]: Without dead ends: 74 [2025-04-29 11:21:32,566 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-29 11:21:32,567 INFO L437 NwaCegarLoop]: 71 mSDtfsCounter, 2 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:21:32,567 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 228 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:21:32,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-04-29 11:21:32,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-04-29 11:21:32,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 70 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:21:32,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2025-04-29 11:21:32,575 INFO L79 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 13 [2025-04-29 11:21:32,576 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:21:32,577 INFO L485 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2025-04-29 11:21:32,577 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:21:32,577 INFO L278 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2025-04-29 11:21:32,577 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 11:21:32,577 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:21:32,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:21:32,578 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:21:32,578 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-04-29 11:21:32,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:21:32,579 INFO L85 PathProgramCache]: Analyzing trace with hash -2001184963, now seen corresponding path program 1 times [2025-04-29 11:21:32,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:21:32,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798536322] [2025-04-29 11:21:32,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:32,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:21:32,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:21:32,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:21:32,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:32,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:32,760 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-29 11:21:32,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:21:32,760 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798536322] [2025-04-29 11:21:32,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798536322] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:21:32,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:21:32,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:21:32,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735030675] [2025-04-29 11:21:32,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:21:32,760 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:21:32,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:21:32,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:21:32,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:21:32,761 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:21:32,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:21:32,844 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2025-04-29 11:21:32,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:21:32,844 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-04-29 11:21:32,844 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:21:32,845 INFO L225 Difference]: With dead ends: 73 [2025-04-29 11:21:32,845 INFO L226 Difference]: Without dead ends: 73 [2025-04-29 11:21:32,845 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-29 11:21:32,845 INFO L437 NwaCegarLoop]: 71 mSDtfsCounter, 1 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:21:32,847 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 248 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:21:32,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-04-29 11:21:32,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-04-29 11:21:32,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:21:32,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2025-04-29 11:21:32,850 INFO L79 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 13 [2025-04-29 11:21:32,850 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:21:32,850 INFO L485 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2025-04-29 11:21:32,850 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:21:32,850 INFO L278 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2025-04-29 11:21:32,853 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:21:32,853 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:21:32,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:21:32,853 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:21:32,853 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-04-29 11:21:32,854 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:21:32,854 INFO L85 PathProgramCache]: Analyzing trace with hash -208557090, now seen corresponding path program 1 times [2025-04-29 11:21:32,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:21:32,854 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993662594] [2025-04-29 11:21:32,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:32,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:21:32,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:21:32,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:21:32,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:32,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:32,900 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-29 11:21:32,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:21:32,900 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993662594] [2025-04-29 11:21:32,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993662594] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:21:32,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:21:32,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:21:32,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272439035] [2025-04-29 11:21:32,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:21:32,901 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:21:32,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:21:32,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:21:32,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:21:32,902 INFO L87 Difference]: Start difference. First operand 73 states and 78 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-29 11:21:32,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:21:32,909 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2025-04-29 11:21:32,911 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:21:32,911 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-29 11:21:32,911 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:21:32,911 INFO L225 Difference]: With dead ends: 78 [2025-04-29 11:21:32,911 INFO L226 Difference]: Without dead ends: 78 [2025-04-29 11:21:32,911 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-29 11:21:32,912 INFO L437 NwaCegarLoop]: 76 mSDtfsCounter, 3 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 149 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-29 11:21:32,912 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 149 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:21:32,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-04-29 11:21:32,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2025-04-29 11:21:32,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 70 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:21:32,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2025-04-29 11:21:32,920 INFO L79 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 14 [2025-04-29 11:21:32,920 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:21:32,920 INFO L485 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2025-04-29 11:21:32,920 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-29 11:21:32,920 INFO L278 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2025-04-29 11:21:32,920 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:21:32,920 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:21:32,920 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:21:32,921 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:21:32,921 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-04-29 11:21:32,921 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:21:32,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1161886900, now seen corresponding path program 1 times [2025-04-29 11:21:32,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:21:32,921 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280746783] [2025-04-29 11:21:32,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:32,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:21:32,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:21:32,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:21:32,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:32,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:33,023 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:21:33,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:21:33,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280746783] [2025-04-29 11:21:33,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280746783] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:21:33,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130431171] [2025-04-29 11:21:33,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:33,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:21:33,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:21:33,026 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-29 11:21:33,027 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-29 11:21:33,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:21:33,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:21:33,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:33,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:33,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:21:33,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:21:33,138 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:21:33,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:21:33,174 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:21:33,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130431171] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:21:33,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:21:33,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-04-29 11:21:33,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300176111] [2025-04-29 11:21:33,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:21:33,177 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:21:33,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:21:33,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:21:33,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:21:33,178 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 11:21:33,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:21:33,193 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2025-04-29 11:21:33,193 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:21:33,194 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2025-04-29 11:21:33,194 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:21:33,194 INFO L225 Difference]: With dead ends: 79 [2025-04-29 11:21:33,194 INFO L226 Difference]: Without dead ends: 79 [2025-04-29 11:21:33,194 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:21:33,195 INFO L437 NwaCegarLoop]: 76 mSDtfsCounter, 3 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:21:33,195 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 148 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:21:33,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-04-29 11:21:33,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-04-29 11:21:33,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 74 states have internal predecessors, (79), 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-29 11:21:33,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2025-04-29 11:21:33,202 INFO L79 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 26 [2025-04-29 11:21:33,202 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:21:33,202 INFO L485 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2025-04-29 11:21:33,203 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 11:21:33,203 INFO L278 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2025-04-29 11:21:33,203 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-29 11:21:33,203 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:21:33,204 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:21:33,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 11:21:33,408 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-29 11:21:33,408 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-04-29 11:21:33,408 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:21:33,408 INFO L85 PathProgramCache]: Analyzing trace with hash 703505850, now seen corresponding path program 2 times [2025-04-29 11:21:33,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:21:33,408 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925637014] [2025-04-29 11:21:33,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:21:33,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:21:33,422 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-29 11:21:33,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:21:33,436 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:21:33,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:33,916 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:21:33,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:21:33,916 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925637014] [2025-04-29 11:21:33,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925637014] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:21:33,916 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612671886] [2025-04-29 11:21:33,916 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:21:33,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:21:33,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:21:33,918 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-29 11:21:33,920 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-29 11:21:33,974 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-29 11:21:34,007 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:21:34,007 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:21:34,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:34,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-29 11:21:34,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:21:34,024 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-29 11:21:34,047 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-29 11:21:34,097 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:21:34,098 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-29 11:21:34,159 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:21:34,160 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-29 11:21:34,225 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-29 11:21:34,240 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:21:34,240 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-29 11:21:34,254 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 15 not checked. [2025-04-29 11:21:34,254 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:21:34,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612671886] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:21:34,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:21:34,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2025-04-29 11:21:34,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989951398] [2025-04-29 11:21:34,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:21:34,658 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:21:34,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:21:34,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:21:34,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=379, Unknown=2, NotChecked=82, Total=552 [2025-04-29 11:21:34,659 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 16 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-04-29 11:21:34,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:21:34,942 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2025-04-29 11:21:34,942 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:21:34,943 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 16 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 38 [2025-04-29 11:21:34,943 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:21:34,943 INFO L225 Difference]: With dead ends: 86 [2025-04-29 11:21:34,943 INFO L226 Difference]: Without dead ends: 86 [2025-04-29 11:21:34,944 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=486, Unknown=2, NotChecked=94, Total=702 [2025-04-29 11:21:34,945 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 106 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 163 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:21:34,945 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 273 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 329 Invalid, 0 Unknown, 163 Unchecked, 0.2s Time] [2025-04-29 11:21:34,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-04-29 11:21:34,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 74. [2025-04-29 11:21:34,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.510204081632653) internal successors, (74), 69 states have internal predecessors, (74), 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-29 11:21:34,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2025-04-29 11:21:34,950 INFO L79 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 38 [2025-04-29 11:21:34,950 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:21:34,950 INFO L485 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2025-04-29 11:21:34,950 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 16 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-04-29 11:21:34,950 INFO L278 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2025-04-29 11:21:34,951 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-29 11:21:34,951 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:21:34,951 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:21:34,957 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-29 11:21:35,151 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-29 11:21:35,152 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-04-29 11:21:35,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:21:35,152 INFO L85 PathProgramCache]: Analyzing trace with hash 703505851, now seen corresponding path program 1 times [2025-04-29 11:21:35,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:21:35,152 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14762592] [2025-04-29 11:21:35,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:35,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:21:35,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 11:21:35,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:21:35,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:35,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:35,647 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-29 11:21:35,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:21:35,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14762592] [2025-04-29 11:21:35,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14762592] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:21:35,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240181251] [2025-04-29 11:21:35,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:35,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:21:35,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:21:35,649 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-29 11:21:35,651 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-29 11:21:35,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 11:21:35,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:21:35,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:35,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:35,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-29 11:21:35,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:21:35,750 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-29 11:21:35,776 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-29 11:21:35,782 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-29 11:21:35,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:21:35,809 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-29 11:21:35,832 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-29 11:21:35,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:21:35,865 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-29 11:21:35,904 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-29 11:21:35,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:21:35,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-29 11:21:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-04-29 11:21:35,960 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:21:35,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240181251] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:21:35,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:21:35,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2025-04-29 11:21:35,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559265296] [2025-04-29 11:21:35,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:21:35,961 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:21:35,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:21:35,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:21:35,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=169, Unknown=1, NotChecked=26, Total=240 [2025-04-29 11:21:35,961 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:21:36,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:21:36,042 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2025-04-29 11:21:36,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:21:36,043 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2025-04-29 11:21:36,043 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:21:36,043 INFO L225 Difference]: With dead ends: 71 [2025-04-29 11:21:36,043 INFO L226 Difference]: Without dead ends: 71 [2025-04-29 11:21:36,044 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 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-29 11:21:36,044 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 4 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:21:36,044 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 196 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 94 Unchecked, 0.1s Time] [2025-04-29 11:21:36,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-04-29 11:21:36,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-04-29 11:21:36,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 66 states have internal predecessors, (71), 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-29 11:21:36,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2025-04-29 11:21:36,047 INFO L79 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 38 [2025-04-29 11:21:36,047 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:21:36,047 INFO L485 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2025-04-29 11:21:36,047 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:21:36,047 INFO L278 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2025-04-29 11:21:36,048 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-29 11:21:36,048 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:21:36,048 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:21:36,059 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-29 11:21:36,248 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-29 11:21:36,249 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-04-29 11:21:36,249 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:21:36,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1571918019, now seen corresponding path program 1 times [2025-04-29 11:21:36,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:21:36,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431511944] [2025-04-29 11:21:36,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:36,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:21:36,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:21:36,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:21:36,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:36,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:36,414 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-29 11:21:36,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:21:36,415 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431511944] [2025-04-29 11:21:36,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431511944] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:21:36,415 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744219869] [2025-04-29 11:21:36,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:36,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:21:36,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:21:36,417 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-29 11:21:36,418 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-29 11:21:36,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:21:36,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:21:36,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:36,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:36,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-29 11:21:36,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:21:36,529 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-29 11:21:36,549 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-29 11:21:36,562 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-29 11:21:36,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:21:36,585 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-29 11:21:36,609 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-29 11:21:36,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:21:36,636 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-29 11:21:36,664 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-29 11:21:36,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:21:36,692 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-29 11:21:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-04-29 11:21:36,717 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:21:36,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744219869] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:21:36,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:21:36,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2025-04-29 11:21:36,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687288960] [2025-04-29 11:21:36,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:21:36,717 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:21:36,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:21:36,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:21:36,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=133, Unknown=1, NotChecked=22, Total=182 [2025-04-29 11:21:36,718 INFO L87 Difference]: Start difference. First operand 71 states and 77 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), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:21:36,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:21:36,760 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2025-04-29 11:21:36,760 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:21:36,760 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), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2025-04-29 11:21:36,761 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:21:36,761 INFO L225 Difference]: With dead ends: 69 [2025-04-29 11:21:36,761 INFO L226 Difference]: Without dead ends: 69 [2025-04-29 11:21:36,761 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=133, Unknown=1, NotChecked=22, Total=182 [2025-04-29 11:21:36,762 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 29 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:21:36,762 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 127 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 84 Unchecked, 0.0s Time] [2025-04-29 11:21:36,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-04-29 11:21:36,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-04-29 11:21:36,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 64 states have internal predecessors, (69), 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-29 11:21:36,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2025-04-29 11:21:36,765 INFO L79 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 42 [2025-04-29 11:21:36,765 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:21:36,766 INFO L485 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2025-04-29 11:21:36,766 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), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:21:36,766 INFO L278 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2025-04-29 11:21:36,766 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-29 11:21:36,766 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:21:36,766 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:21:36,774 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-29 11:21:36,967 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-29 11:21:36,967 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-04-29 11:21:36,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:21:36,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1571765057, now seen corresponding path program 1 times [2025-04-29 11:21:36,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:21:36,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907843999] [2025-04-29 11:21:36,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:36,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:21:36,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:21:36,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:21:36,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:36,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:37,228 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:21:37,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:21:37,229 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907843999] [2025-04-29 11:21:37,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907843999] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:21:37,229 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193648593] [2025-04-29 11:21:37,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:37,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:21:37,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:21:37,231 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-29 11:21:37,233 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-29 11:21:37,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:21:37,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:21:37,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:37,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:37,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-29 11:21:37,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:21:37,409 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-29 11:21:37,494 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-29 11:21:37,498 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-29 11:21:37,519 INFO L325 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-04-29 11:21:37,520 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 16 treesize of output 18 [2025-04-29 11:21:37,553 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-29 11:21:37,557 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2025-04-29 11:21:37,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:21:37,675 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 18 treesize of output 10 [2025-04-29 11:21:37,702 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:21:37,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193648593] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:21:37,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:21:37,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 22 [2025-04-29 11:21:37,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675524685] [2025-04-29 11:21:37,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:21:37,704 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:21:37,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:21:37,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:21:37,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=405, Unknown=1, NotChecked=40, Total=506 [2025-04-29 11:21:37,705 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 20 states have internal predecessors, (61), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-04-29 11:21:38,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:21:38,052 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2025-04-29 11:21:38,052 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:21:38,053 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 20 states have internal predecessors, (61), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 42 [2025-04-29 11:21:38,053 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:21:38,053 INFO L225 Difference]: With dead ends: 68 [2025-04-29 11:21:38,053 INFO L226 Difference]: Without dead ends: 68 [2025-04-29 11:21:38,054 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=667, Unknown=1, NotChecked=52, Total=812 [2025-04-29 11:21:38,054 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 45 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:21:38,054 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 477 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 622 Invalid, 0 Unknown, 67 Unchecked, 0.3s Time] [2025-04-29 11:21:38,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-04-29 11:21:38,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-04-29 11:21:38,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.38) internal successors, (69), 63 states have internal predecessors, (69), 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-29 11:21:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2025-04-29 11:21:38,056 INFO L79 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 42 [2025-04-29 11:21:38,056 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:21:38,056 INFO L485 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2025-04-29 11:21:38,059 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 20 states have internal predecessors, (61), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-04-29 11:21:38,059 INFO L278 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2025-04-29 11:21:38,060 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-29 11:21:38,060 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:21:38,060 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:21:38,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-29 11:21:38,261 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-29 11:21:38,261 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-04-29 11:21:38,261 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:21:38,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1571765056, now seen corresponding path program 1 times [2025-04-29 11:21:38,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:21:38,261 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793644809] [2025-04-29 11:21:38,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:38,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:21:38,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:21:38,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:21:38,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:38,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:38,592 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:21:38,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:21:38,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793644809] [2025-04-29 11:21:38,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793644809] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:21:38,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110221395] [2025-04-29 11:21:38,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:38,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:21:38,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:21:38,595 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-29 11:21:38,596 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-29 11:21:38,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:21:38,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:21:38,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:38,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:38,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-04-29 11:21:38,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:21:38,730 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-29 11:21:38,911 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-29 11:21:38,914 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-29 11:21:38,941 WARN L871 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)) (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-29 11:21:38,974 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-29 11:21:38,974 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-29 11:21:38,979 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-29 11:21:39,049 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-29 11:21:39,092 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2025-04-29 11:21:39,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:21:39,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110221395] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:21:39,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:21:39,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2025-04-29 11:21:39,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055993551] [2025-04-29 11:21:39,260 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:21:39,260 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-29 11:21:39,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:21:39,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-29 11:21:39,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=849, Unknown=1, NotChecked=58, Total=992 [2025-04-29 11:21:39,261 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand has 28 states, 26 states have (on average 2.423076923076923) internal successors, (63), 24 states have internal predecessors, (63), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-29 11:21:39,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:21:39,938 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2025-04-29 11:21:39,941 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 11:21:39,942 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.423076923076923) internal successors, (63), 24 states have internal predecessors, (63), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 42 [2025-04-29 11:21:39,942 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:21:39,942 INFO L225 Difference]: With dead ends: 78 [2025-04-29 11:21:39,942 INFO L226 Difference]: Without dead ends: 78 [2025-04-29 11:21:39,943 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=176, Invalid=1897, Unknown=1, NotChecked=88, Total=2162 [2025-04-29 11:21:39,943 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 49 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:21:39,943 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 695 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 805 Invalid, 0 Unknown, 76 Unchecked, 0.4s Time] [2025-04-29 11:21:39,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-04-29 11:21:39,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-04-29 11:21:39,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 72 states have internal predecessors, (78), 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-29 11:21:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2025-04-29 11:21:39,946 INFO L79 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 42 [2025-04-29 11:21:39,946 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:21:39,946 INFO L485 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2025-04-29 11:21:39,946 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.423076923076923) internal successors, (63), 24 states have internal predecessors, (63), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-29 11:21:39,946 INFO L278 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2025-04-29 11:21:39,946 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-29 11:21:39,946 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:21:39,947 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:21:39,953 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-29 11:21:40,151 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:21:40,151 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-04-29 11:21:40,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:21:40,151 INFO L85 PathProgramCache]: Analyzing trace with hash -981273627, now seen corresponding path program 1 times [2025-04-29 11:21:40,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:21:40,151 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939528022] [2025-04-29 11:21:40,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:40,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:21:40,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:21:40,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:21:40,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:40,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-29 11:21:40,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:21:40,343 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939528022] [2025-04-29 11:21:40,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939528022] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:21:40,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:21:40,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:21:40,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595253937] [2025-04-29 11:21:40,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:21:40,344 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:21:40,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:21:40,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:21:40,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:21:40,345 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 10 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 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-29 11:21:40,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:21:40,468 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2025-04-29 11:21:40,468 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:21:40,468 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 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 45 [2025-04-29 11:21:40,468 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:21:40,469 INFO L225 Difference]: With dead ends: 92 [2025-04-29 11:21:40,469 INFO L226 Difference]: Without dead ends: 92 [2025-04-29 11:21:40,469 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:21:40,469 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 22 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:21:40,470 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 271 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:21:40,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-04-29 11:21:40,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2025-04-29 11:21:40,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 64 states have (on average 1.3125) internal successors, (84), 76 states have internal predecessors, (84), 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-29 11:21:40,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2025-04-29 11:21:40,473 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 45 [2025-04-29 11:21:40,473 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:21:40,473 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2025-04-29 11:21:40,473 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 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-29 11:21:40,473 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2025-04-29 11:21:40,473 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-29 11:21:40,473 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:21:40,474 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:21:40,474 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:21:40,474 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-04-29 11:21:40,474 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:21:40,474 INFO L85 PathProgramCache]: Analyzing trace with hash -981273626, now seen corresponding path program 1 times [2025-04-29 11:21:40,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:21:40,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118005128] [2025-04-29 11:21:40,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:40,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:21:40,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:21:40,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:21:40,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:40,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:40,656 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-29 11:21:40,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:21:40,657 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118005128] [2025-04-29 11:21:40,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118005128] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:21:40,657 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396192693] [2025-04-29 11:21:40,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:40,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:21:40,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:21:40,659 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-29 11:21:40,660 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-29 11:21:40,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:21:40,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:21:40,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:40,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:40,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-29 11:21:40,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:21:40,935 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:21:40,937 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:21:40,938 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-29 11:21:40,949 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:21:40,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:21:40,981 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:21:40,981 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-29 11:21:41,100 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-29 11:21:41,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396192693] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:21:41,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:21:41,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 23 [2025-04-29 11:21:41,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712459123] [2025-04-29 11:21:41,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:21:41,101 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:21:41,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:21:41,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:21:41,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:21:41,102 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 20 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-04-29 11:21:45,123 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-29 11:21:49,135 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-29 11:21:53,170 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-29 11:21:57,217 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-29 11:21:57,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:21:57,361 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2025-04-29 11:21:57,361 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:21:57,362 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 20 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 45 [2025-04-29 11:21:57,362 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:21:57,362 INFO L225 Difference]: With dead ends: 76 [2025-04-29 11:21:57,362 INFO L226 Difference]: Without dead ends: 76 [2025-04-29 11:21:57,362 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2025-04-29 11:21:57,363 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 86 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:21:57,363 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 741 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 311 Invalid, 4 Unknown, 0 Unchecked, 16.2s Time] [2025-04-29 11:21:57,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-04-29 11:21:57,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-04-29 11:21:57,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.293103448275862) internal successors, (75), 70 states have internal predecessors, (75), 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-29 11:21:57,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2025-04-29 11:21:57,365 INFO L79 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 45 [2025-04-29 11:21:57,365 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:21:57,365 INFO L485 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2025-04-29 11:21:57,365 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 20 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-04-29 11:21:57,365 INFO L278 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2025-04-29 11:21:57,365 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-29 11:21:57,365 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:21:57,365 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:21:57,377 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-29 11:21:57,571 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:21:57,571 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-04-29 11:21:57,571 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:21:57,572 INFO L85 PathProgramCache]: Analyzing trace with hash -824705001, now seen corresponding path program 1 times [2025-04-29 11:21:57,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:21:57,572 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683125307] [2025-04-29 11:21:57,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:57,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:21:57,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:21:57,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:21:57,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:57,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:58,377 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:21:58,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:21:58,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683125307] [2025-04-29 11:21:58,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683125307] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:21:58,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251312160] [2025-04-29 11:21:58,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:21:58,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:21:58,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:21:58,380 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-29 11:21:58,398 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-29 11:21:58,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:21:58,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:21:58,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:21:58,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:21:58,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-04-29 11:21:58,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:21:58,775 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:21:58,775 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-29 11:21:58,840 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:21:58,988 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 13 treesize of output 5 [2025-04-29 11:21:58,993 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-29 11:21:58,993 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 7 [2025-04-29 11:21:59,133 WARN L871 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#0.base| |node_create_~temp~0#1.base|))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_9| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_9|) 0) 0))) is different from true [2025-04-29 11:21:59,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:21:59,161 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 22 treesize of output 17 [2025-04-29 11:21:59,182 INFO L325 Elim1Store]: treesize reduction 92, result has 31.9 percent of original size [2025-04-29 11:21:59,182 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 57 [2025-04-29 11:21:59,291 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 50 treesize of output 30 [2025-04-29 11:21:59,427 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-04-29 11:21:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-04-29 11:21:59,514 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:21:59,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251312160] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:21:59,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:21:59,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 45 [2025-04-29 11:21:59,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106938648] [2025-04-29 11:21:59,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:21:59,721 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-29 11:21:59,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:21:59,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-29 11:21:59,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2276, Unknown=1, NotChecked=96, Total=2550 [2025-04-29 11:21:59,722 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 46 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 40 states have internal predecessors, (79), 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-29 11:22:00,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:22:00,635 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2025-04-29 11:22:00,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-29 11:22:00,635 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 40 states have internal predecessors, (79), 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 46 [2025-04-29 11:22:00,635 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:22:00,636 INFO L225 Difference]: With dead ends: 84 [2025-04-29 11:22:00,636 INFO L226 Difference]: Without dead ends: 84 [2025-04-29 11:22:00,637 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1131 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=309, Invalid=3984, Unknown=1, NotChecked=128, Total=4422 [2025-04-29 11:22:00,637 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 57 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:22:00,637 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 706 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1170 Invalid, 0 Unknown, 91 Unchecked, 0.5s Time] [2025-04-29 11:22:00,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-04-29 11:22:00,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2025-04-29 11:22:00,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.3) internal successors, (78), 72 states have internal predecessors, (78), 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-29 11:22:00,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2025-04-29 11:22:00,642 INFO L79 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 46 [2025-04-29 11:22:00,642 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:22:00,642 INFO L485 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2025-04-29 11:22:00,642 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 40 states have internal predecessors, (79), 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-29 11:22:00,642 INFO L278 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2025-04-29 11:22:00,643 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-29 11:22:00,643 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:22:00,643 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:22:00,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-29 11:22:00,843 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,SelfDestructingSolverStorable13 [2025-04-29 11:22:00,843 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-04-29 11:22:00,844 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:22:00,844 INFO L85 PathProgramCache]: Analyzing trace with hash -824705000, now seen corresponding path program 1 times [2025-04-29 11:22:00,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:22:00,844 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698403891] [2025-04-29 11:22:00,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:00,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:22:00,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:22:00,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:22:00,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:00,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:01,963 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:01,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:22:01,963 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698403891] [2025-04-29 11:22:01,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698403891] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:01,963 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492746286] [2025-04-29 11:22:01,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:22:01,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:22:01,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:22:01,965 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-29 11:22:01,966 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-29 11:22:02,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:22:02,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:22:02,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:22:02,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:22:02,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 115 conjuncts are in the unsatisfiable core [2025-04-29 11:22:02,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:22:02,169 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-29 11:22:02,400 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 11:22:02,400 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 17 treesize of output 21 [2025-04-29 11:22:02,408 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-29 11:22:02,503 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 15 treesize of output 1 [2025-04-29 11:22:02,505 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:22:02,683 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 43 treesize of output 19 [2025-04-29 11:22:02,686 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-29 11:22:02,688 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-29 11:22:02,690 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 11 treesize of output 3 [2025-04-29 11:22:19,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:22:19,921 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 51 treesize of output 34 [2025-04-29 11:22:20,022 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-29 11:22:20,023 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-29 11:22:20,039 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-29 11:22:20,049 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 20 treesize of output 15 [2025-04-29 11:22:24,762 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 68 treesize of output 40 [2025-04-29 11:22:25,941 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-04-29 11:22:25,950 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-04-29 11:22:26,702 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:22:26,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:22:30,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492746286] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:22:30,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:22:30,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 50 [2025-04-29 11:22:30,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954408182] [2025-04-29 11:22:30,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:22:30,301 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-04-29 11:22:30,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:22:30,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-04-29 11:22:30,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=3016, Unknown=3, NotChecked=0, Total=3192 [2025-04-29 11:22:30,303 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 51 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 44 states have internal predecessors, (77), 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-29 11:22:41,224 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] Killed by 15