./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/heap-manipulation/dancing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/dancing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:10:03,569 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:10:03,609 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 12:10:03,613 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:10:03,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:10:03,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:10:03,638 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:10:03,638 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:10:03,638 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:10:03,638 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:10:03,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:10:03,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:10:03,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:10:03,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:10:03,639 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:10:03,639 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:10:03,639 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 12:10:03,639 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:10:03,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 12:10:03,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:10:03,641 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:10:03,641 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:10:03,642 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:10:03,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:10:03,642 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:10:03,642 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:10:03,642 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 12:10:03,642 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:10:03,642 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:10:03,642 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:10:03,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:10:03,642 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:10:03,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:10:03,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:10:03,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:10:03,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:10:03,642 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 12:10:03,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 12:10:03,642 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:10:03,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:10:03,643 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:10:03,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:10:03,643 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 -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2025-03-17 12:10:03,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:10:03,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:10:03,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:10:03,892 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:10:03,892 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:10:03,894 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dancing.i [2025-03-17 12:10:05,088 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7e8aae2b/f8acac0ada4745199c1d4f6661eeccbf/FLAGd81a241bc [2025-03-17 12:10:05,343 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:10:05,344 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2025-03-17 12:10:05,356 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7e8aae2b/f8acac0ada4745199c1d4f6661eeccbf/FLAGd81a241bc [2025-03-17 12:10:05,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7e8aae2b/f8acac0ada4745199c1d4f6661eeccbf [2025-03-17 12:10:05,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:10:05,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:10:05,640 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:10:05,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:10:05,643 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:10:05,644 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:10:05" (1/1) ... [2025-03-17 12:10:05,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42bd4c72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:05, skipping insertion in model container [2025-03-17 12:10:05,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:10:05" (1/1) ... [2025-03-17 12:10:05,671 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:10:05,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:10:05,829 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:10:05,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:10:05,884 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:10:05,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:05 WrapperNode [2025-03-17 12:10:05,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:10:05,886 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:10:05,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:10:05,887 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:10:05,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:05" (1/1) ... [2025-03-17 12:10:05,903 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:05" (1/1) ... [2025-03-17 12:10:05,925 INFO L138 Inliner]: procedures = 124, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 95 [2025-03-17 12:10:05,926 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:10:05,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:10:05,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:10:05,926 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:10:05,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:05" (1/1) ... [2025-03-17 12:10:05,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:05" (1/1) ... [2025-03-17 12:10:05,936 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:05" (1/1) ... [2025-03-17 12:10:05,956 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [2, 21]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2025-03-17 12:10:05,957 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:05" (1/1) ... [2025-03-17 12:10:05,957 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:05" (1/1) ... [2025-03-17 12:10:05,965 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:05" (1/1) ... [2025-03-17 12:10:05,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:05" (1/1) ... [2025-03-17 12:10:05,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:05" (1/1) ... [2025-03-17 12:10:05,968 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:05" (1/1) ... [2025-03-17 12:10:05,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:10:05,971 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:10:05,971 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:10:05,971 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:10:05,972 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:05" (1/1) ... [2025-03-17 12:10:05,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:10:05,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:10:06,002 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 12:10:06,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 12:10:06,027 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2025-03-17 12:10:06,028 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2025-03-17 12:10:06,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 12:10:06,028 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 12:10:06,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 12:10:06,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 12:10:06,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 12:10:06,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 12:10:06,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 12:10:06,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 12:10:06,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 12:10:06,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 12:10:06,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 12:10:06,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 12:10:06,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:10:06,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:10:06,120 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:10:06,122 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:10:06,405 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L603: call ULTIMATE.dealloc(main_~#list~0#1.base, main_~#list~0#1.offset);havoc main_~#list~0#1.base, main_~#list~0#1.offset; [2025-03-17 12:10:06,422 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2025-03-17 12:10:06,422 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:10:06,430 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:10:06,431 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:10:06,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:10:06 BoogieIcfgContainer [2025-03-17 12:10:06,431 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:10:06,434 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:10:06,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:10:06,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:10:06,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:10:05" (1/3) ... [2025-03-17 12:10:06,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350f1b04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:10:06, skipping insertion in model container [2025-03-17 12:10:06,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:10:05" (2/3) ... [2025-03-17 12:10:06,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350f1b04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:10:06, skipping insertion in model container [2025-03-17 12:10:06,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:10:06" (3/3) ... [2025-03-17 12:10:06,440 INFO L128 eAbstractionObserver]: Analyzing ICFG dancing.i [2025-03-17 12:10:06,449 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:10:06,450 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dancing.i that has 3 procedures, 108 locations, 1 initial locations, 1 loop locations, and 44 error locations. [2025-03-17 12:10:06,477 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:10:06,487 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1cdc44c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:10:06,487 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-03-17 12:10:06,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 55 states have (on average 2.0545454545454547) internal successors, (113), 99 states have internal predecessors, (113), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:10:06,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 12:10:06,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:06,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 12:10:06,497 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:10:06,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:06,501 INFO L85 PathProgramCache]: Analyzing trace with hash 4607, now seen corresponding path program 1 times [2025-03-17 12:10:06,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:06,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22722593] [2025-03-17 12:10:06,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:06,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:06,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 12:10:06,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 12:10:06,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:06,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:06,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:06,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:06,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22722593] [2025-03-17 12:10:06,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22722593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:06,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:06,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 12:10:06,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690709864] [2025-03-17 12:10:06,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:06,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:10:06,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:06,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:10:06,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:10:06,691 INFO L87 Difference]: Start difference. First operand has 108 states, 55 states have (on average 2.0545454545454547) internal successors, (113), 99 states have internal predecessors, (113), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:06,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:06,787 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2025-03-17 12:10:06,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:10:06,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-03-17 12:10:06,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:06,794 INFO L225 Difference]: With dead ends: 105 [2025-03-17 12:10:06,794 INFO L226 Difference]: Without dead ends: 103 [2025-03-17 12:10:06,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:10:06,798 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 79 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:06,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 94 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:10:06,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-17 12:10:06,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-17 12:10:06,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 53 states have (on average 1.9622641509433962) internal successors, (104), 94 states have internal predecessors, (104), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:10:06,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2025-03-17 12:10:06,834 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 2 [2025-03-17 12:10:06,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:06,834 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2025-03-17 12:10:06,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:06,834 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2025-03-17 12:10:06,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 12:10:06,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:06,835 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 12:10:06,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 12:10:06,835 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:10:06,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:06,835 INFO L85 PathProgramCache]: Analyzing trace with hash 4608, now seen corresponding path program 1 times [2025-03-17 12:10:06,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:06,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896455677] [2025-03-17 12:10:06,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:06,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:06,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 12:10:06,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 12:10:06,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:06,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:06,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:06,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:06,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896455677] [2025-03-17 12:10:06,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896455677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:06,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:06,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 12:10:06,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686683580] [2025-03-17 12:10:06,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:06,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:10:06,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:06,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:10:06,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:10:06,939 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:07,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:07,022 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2025-03-17 12:10:07,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:10:07,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-03-17 12:10:07,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:07,024 INFO L225 Difference]: With dead ends: 101 [2025-03-17 12:10:07,025 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 12:10:07,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:10:07,025 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 79 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:07,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 92 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:10:07,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 12:10:07,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-17 12:10:07,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 92 states have internal predecessors, (102), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:10:07,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2025-03-17 12:10:07,036 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 2 [2025-03-17 12:10:07,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:07,037 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2025-03-17 12:10:07,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:07,038 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2025-03-17 12:10:07,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 12:10:07,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:07,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:07,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 12:10:07,038 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:10:07,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:07,039 INFO L85 PathProgramCache]: Analyzing trace with hash -2067882151, now seen corresponding path program 1 times [2025-03-17 12:10:07,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:07,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406593324] [2025-03-17 12:10:07,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:07,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:07,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 12:10:07,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 12:10:07,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:07,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:07,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:07,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:07,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406593324] [2025-03-17 12:10:07,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406593324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:07,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:07,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:10:07,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219962208] [2025-03-17 12:10:07,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:07,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:10:07,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:07,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:10:07,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:10:07,126 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:07,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:07,202 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2025-03-17 12:10:07,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:10:07,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 12:10:07,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:07,203 INFO L225 Difference]: With dead ends: 100 [2025-03-17 12:10:07,203 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 12:10:07,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:10:07,204 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 7 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:07,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 165 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:10:07,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 12:10:07,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-03-17 12:10:07,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 53 states have (on average 1.8867924528301887) internal successors, (100), 90 states have internal predecessors, (100), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:10:07,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2025-03-17 12:10:07,213 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 8 [2025-03-17 12:10:07,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:07,213 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2025-03-17 12:10:07,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:07,214 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2025-03-17 12:10:07,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 12:10:07,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:07,214 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:07,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 12:10:07,214 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:10:07,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:07,217 INFO L85 PathProgramCache]: Analyzing trace with hash -2067882150, now seen corresponding path program 1 times [2025-03-17 12:10:07,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:07,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125250480] [2025-03-17 12:10:07,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:07,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:07,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 12:10:07,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 12:10:07,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:07,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:07,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:07,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:07,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125250480] [2025-03-17 12:10:07,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125250480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:07,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:07,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:10:07,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082676230] [2025-03-17 12:10:07,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:07,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:10:07,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:07,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:10:07,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:10:07,322 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:07,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:07,384 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2025-03-17 12:10:07,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:10:07,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 12:10:07,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:07,385 INFO L225 Difference]: With dead ends: 98 [2025-03-17 12:10:07,386 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 12:10:07,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:10:07,386 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 7 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:07,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 167 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:10:07,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 12:10:07,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-03-17 12:10:07,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 53 states have (on average 1.849056603773585) internal successors, (98), 88 states have internal predecessors, (98), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:10:07,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2025-03-17 12:10:07,394 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 8 [2025-03-17 12:10:07,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:07,394 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2025-03-17 12:10:07,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:07,394 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2025-03-17 12:10:07,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 12:10:07,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:07,394 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:07,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 12:10:07,394 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting is_list_containing_xErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:10:07,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:07,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1335150751, now seen corresponding path program 1 times [2025-03-17 12:10:07,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:07,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067967552] [2025-03-17 12:10:07,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:07,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:07,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 12:10:07,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 12:10:07,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:07,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:07,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:07,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:07,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067967552] [2025-03-17 12:10:07,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067967552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:07,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:07,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:10:07,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811088461] [2025-03-17 12:10:07,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:07,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:10:07,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:07,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:10:07,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:10:07,495 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:07,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:07,563 INFO L93 Difference]: Finished difference Result 172 states and 197 transitions. [2025-03-17 12:10:07,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:10:07,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2025-03-17 12:10:07,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:07,564 INFO L225 Difference]: With dead ends: 172 [2025-03-17 12:10:07,564 INFO L226 Difference]: Without dead ends: 172 [2025-03-17 12:10:07,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:10:07,565 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 73 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:07,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 395 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:10:07,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-17 12:10:07,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 140. [2025-03-17 12:10:07,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 91 states have (on average 1.9120879120879122) internal successors, (174), 127 states have internal predecessors, (174), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 12:10:07,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2025-03-17 12:10:07,574 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 10 [2025-03-17 12:10:07,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:07,574 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2025-03-17 12:10:07,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:07,577 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2025-03-17 12:10:07,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 12:10:07,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:07,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:07,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 12:10:07,577 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:10:07,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:07,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1335112950, now seen corresponding path program 1 times [2025-03-17 12:10:07,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:07,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664837346] [2025-03-17 12:10:07,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:07,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:07,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 12:10:07,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 12:10:07,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:07,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:07,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:07,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:07,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664837346] [2025-03-17 12:10:07,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664837346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:07,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:07,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:10:07,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983436141] [2025-03-17 12:10:07,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:07,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:10:07,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:07,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:10:07,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:10:07,728 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:07,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:07,811 INFO L93 Difference]: Finished difference Result 139 states and 192 transitions. [2025-03-17 12:10:07,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 12:10:07,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-17 12:10:07,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:07,813 INFO L225 Difference]: With dead ends: 139 [2025-03-17 12:10:07,813 INFO L226 Difference]: Without dead ends: 139 [2025-03-17 12:10:07,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:10:07,814 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 139 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:07,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 122 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:10:07,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-17 12:10:07,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-03-17 12:10:07,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 91 states have (on average 1.89010989010989) internal successors, (172), 126 states have internal predecessors, (172), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 12:10:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 192 transitions. [2025-03-17 12:10:07,820 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 192 transitions. Word has length 10 [2025-03-17 12:10:07,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:07,820 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 192 transitions. [2025-03-17 12:10:07,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:07,820 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 192 transitions. [2025-03-17 12:10:07,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 12:10:07,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:07,821 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:07,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 12:10:07,821 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:10:07,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:07,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1335112951, now seen corresponding path program 1 times [2025-03-17 12:10:07,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:07,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723830664] [2025-03-17 12:10:07,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:07,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:07,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 12:10:07,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 12:10:07,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:07,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:07,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:07,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:07,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723830664] [2025-03-17 12:10:07,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723830664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:07,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:07,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:10:07,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041675423] [2025-03-17 12:10:07,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:07,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:10:07,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:07,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:10:08,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:10:08,000 INFO L87 Difference]: Start difference. First operand 139 states and 192 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:08,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:08,129 INFO L93 Difference]: Finished difference Result 138 states and 190 transitions. [2025-03-17 12:10:08,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:10:08,129 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-17 12:10:08,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:08,130 INFO L225 Difference]: With dead ends: 138 [2025-03-17 12:10:08,130 INFO L226 Difference]: Without dead ends: 138 [2025-03-17 12:10:08,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:10:08,131 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 143 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:08,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 137 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:10:08,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-17 12:10:08,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-03-17 12:10:08,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 91 states have (on average 1.8681318681318682) internal successors, (170), 125 states have internal predecessors, (170), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 12:10:08,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 190 transitions. [2025-03-17 12:10:08,139 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 190 transitions. Word has length 10 [2025-03-17 12:10:08,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:08,139 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 190 transitions. [2025-03-17 12:10:08,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:08,139 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 190 transitions. [2025-03-17 12:10:08,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 12:10:08,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:08,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:08,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 12:10:08,140 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:10:08,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:08,140 INFO L85 PathProgramCache]: Analyzing trace with hash -2134855679, now seen corresponding path program 1 times [2025-03-17 12:10:08,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:08,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344232060] [2025-03-17 12:10:08,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:08,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:08,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 12:10:08,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 12:10:08,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:08,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:08,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-03-17 12:10:08,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:08,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344232060] [2025-03-17 12:10:08,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344232060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:08,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:08,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:10:08,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239149103] [2025-03-17 12:10:08,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:08,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:10:08,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:08,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:10:08,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:10:08,257 INFO L87 Difference]: Start difference. First operand 138 states and 190 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:10:08,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:08,447 INFO L93 Difference]: Finished difference Result 165 states and 189 transitions. [2025-03-17 12:10:08,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:10:08,447 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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 15 [2025-03-17 12:10:08,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:08,448 INFO L225 Difference]: With dead ends: 165 [2025-03-17 12:10:08,448 INFO L226 Difference]: Without dead ends: 165 [2025-03-17 12:10:08,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:10:08,449 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 271 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:08,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 185 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:10:08,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-17 12:10:08,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 138. [2025-03-17 12:10:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 91 states have (on average 1.8021978021978022) internal successors, (164), 125 states have internal predecessors, (164), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 12:10:08,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 184 transitions. [2025-03-17 12:10:08,457 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 184 transitions. Word has length 15 [2025-03-17 12:10:08,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:08,457 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 184 transitions. [2025-03-17 12:10:08,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:10:08,457 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 184 transitions. [2025-03-17 12:10:08,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 12:10:08,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:08,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:08,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 12:10:08,457 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:10:08,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:08,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2134855680, now seen corresponding path program 1 times [2025-03-17 12:10:08,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:08,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689969132] [2025-03-17 12:10:08,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:08,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:08,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 12:10:08,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 12:10:08,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:08,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:08,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:08,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:08,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689969132] [2025-03-17 12:10:08,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689969132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:08,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:08,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:10:08,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346708032] [2025-03-17 12:10:08,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:08,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:10:08,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:08,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:10:08,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:10:08,510 INFO L87 Difference]: Start difference. First operand 138 states and 184 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:10:08,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:08,648 INFO L93 Difference]: Finished difference Result 153 states and 178 transitions. [2025-03-17 12:10:08,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:10:08,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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 15 [2025-03-17 12:10:08,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:08,649 INFO L225 Difference]: With dead ends: 153 [2025-03-17 12:10:08,649 INFO L226 Difference]: Without dead ends: 153 [2025-03-17 12:10:08,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:10:08,650 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 255 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:08,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 172 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:10:08,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-17 12:10:08,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 133. [2025-03-17 12:10:08,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 91 states have (on average 1.6813186813186813) internal successors, (153), 120 states have internal predecessors, (153), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 12:10:08,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 173 transitions. [2025-03-17 12:10:08,654 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 173 transitions. Word has length 15 [2025-03-17 12:10:08,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:08,654 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 173 transitions. [2025-03-17 12:10:08,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:10:08,654 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 173 transitions. [2025-03-17 12:10:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 12:10:08,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:08,654 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:08,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 12:10:08,655 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:10:08,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:08,655 INFO L85 PathProgramCache]: Analyzing trace with hash -788643974, now seen corresponding path program 1 times [2025-03-17 12:10:08,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:08,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795715963] [2025-03-17 12:10:08,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:08,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:08,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 12:10:08,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 12:10:08,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:08,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:08,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:08,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:08,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795715963] [2025-03-17 12:10:08,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795715963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:08,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:08,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 12:10:08,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329774940] [2025-03-17 12:10:08,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:08,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:10:08,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:08,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:10:08,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:10:08,854 INFO L87 Difference]: Start difference. First operand 133 states and 173 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:10:09,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:09,010 INFO L93 Difference]: Finished difference Result 182 states and 232 transitions. [2025-03-17 12:10:09,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:10:09,010 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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 19 [2025-03-17 12:10:09,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:09,011 INFO L225 Difference]: With dead ends: 182 [2025-03-17 12:10:09,011 INFO L226 Difference]: Without dead ends: 182 [2025-03-17 12:10:09,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 12:10:09,012 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 240 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:09,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 363 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:10:09,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-17 12:10:09,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 142. [2025-03-17 12:10:09,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 99 states have (on average 1.6464646464646464) internal successors, (163), 128 states have internal predecessors, (163), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 12:10:09,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 185 transitions. [2025-03-17 12:10:09,016 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 185 transitions. Word has length 19 [2025-03-17 12:10:09,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:09,016 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 185 transitions. [2025-03-17 12:10:09,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:10:09,016 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 185 transitions. [2025-03-17 12:10:09,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 12:10:09,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:09,017 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:09,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 12:10:09,017 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting is_list_containing_xErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:10:09,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:09,017 INFO L85 PathProgramCache]: Analyzing trace with hash 65941509, now seen corresponding path program 1 times [2025-03-17 12:10:09,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:09,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444987546] [2025-03-17 12:10:09,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:09,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:09,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 12:10:09,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 12:10:09,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:09,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:09,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:09,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:09,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444987546] [2025-03-17 12:10:09,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444987546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:10:09,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688718027] [2025-03-17 12:10:09,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:09,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:10:09,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:10:09,109 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:10:09,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 12:10:09,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 12:10:09,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 12:10:09,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:09,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:09,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 12:10:09,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:10:09,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:09,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:10:09,263 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 12:10:09,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2025-03-17 12:10:09,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:09,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688718027] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:10:09,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:10:09,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-03-17 12:10:09,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233007531] [2025-03-17 12:10:09,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:10:09,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:10:09,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:09,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:10:09,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:10:09,283 INFO L87 Difference]: Start difference. First operand 142 states and 185 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:09,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:09,422 INFO L93 Difference]: Finished difference Result 156 states and 204 transitions. [2025-03-17 12:10:09,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:10:09,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (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 19 [2025-03-17 12:10:09,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:09,424 INFO L225 Difference]: With dead ends: 156 [2025-03-17 12:10:09,424 INFO L226 Difference]: Without dead ends: 156 [2025-03-17 12:10:09,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:10:09,425 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 141 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:09,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 190 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:10:09,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-17 12:10:09,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 150. [2025-03-17 12:10:09,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 106 states have (on average 1.6320754716981132) internal successors, (173), 134 states have internal predecessors, (173), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 12:10:09,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 197 transitions. [2025-03-17 12:10:09,429 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 197 transitions. Word has length 19 [2025-03-17 12:10:09,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:09,430 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 197 transitions. [2025-03-17 12:10:09,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:09,430 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 197 transitions. [2025-03-17 12:10:09,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 12:10:09,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:09,430 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:09,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 12:10:09,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 12:10:09,634 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting is_list_containing_xErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:10:09,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:09,634 INFO L85 PathProgramCache]: Analyzing trace with hash 65941510, now seen corresponding path program 1 times [2025-03-17 12:10:09,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:09,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251497964] [2025-03-17 12:10:09,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:09,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:09,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 12:10:09,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 12:10:09,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:09,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:09,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:09,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:09,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251497964] [2025-03-17 12:10:09,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251497964] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:10:09,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241272801] [2025-03-17 12:10:09,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:09,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:10:09,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:10:09,777 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:10:09,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 12:10:09,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 12:10:09,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 12:10:09,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:09,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:09,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 12:10:09,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:10:10,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:10,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:10:10,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:10,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-17 12:10:10,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:10,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241272801] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:10:10,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:10:10,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 5] total 15 [2025-03-17 12:10:10,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796737752] [2025-03-17 12:10:10,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:10:10,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 12:10:10,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:10,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 12:10:10,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-03-17 12:10:10,156 INFO L87 Difference]: Start difference. First operand 150 states and 197 transitions. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:10,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:10,461 INFO L93 Difference]: Finished difference Result 154 states and 202 transitions. [2025-03-17 12:10:10,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:10:10,462 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-17 12:10:10,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:10,462 INFO L225 Difference]: With dead ends: 154 [2025-03-17 12:10:10,463 INFO L226 Difference]: Without dead ends: 154 [2025-03-17 12:10:10,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2025-03-17 12:10:10,463 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 278 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:10,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 364 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:10:10,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-17 12:10:10,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 149. [2025-03-17 12:10:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 106 states have (on average 1.6037735849056605) internal successors, (170), 133 states have internal predecessors, (170), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 12:10:10,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 194 transitions. [2025-03-17 12:10:10,469 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 194 transitions. Word has length 19 [2025-03-17 12:10:10,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:10,469 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 194 transitions. [2025-03-17 12:10:10,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:10,469 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 194 transitions. [2025-03-17 12:10:10,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 12:10:10,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:10,470 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:10,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 12:10:10,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 12:10:10,670 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:10:10,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:10,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1952542643, now seen corresponding path program 1 times [2025-03-17 12:10:10,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:10,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858705827] [2025-03-17 12:10:10,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:10,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:10,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 12:10:10,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 12:10:10,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:10,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:10,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:10,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:10,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858705827] [2025-03-17 12:10:10,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858705827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:10,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:10,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:10:10,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143410813] [2025-03-17 12:10:10,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:10,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:10:10,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:10,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:10:10,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:10:10,846 INFO L87 Difference]: Start difference. First operand 149 states and 194 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:10:10,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:10,967 INFO L93 Difference]: Finished difference Result 184 states and 235 transitions. [2025-03-17 12:10:10,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:10:10,967 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 21 [2025-03-17 12:10:10,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:10,968 INFO L225 Difference]: With dead ends: 184 [2025-03-17 12:10:10,968 INFO L226 Difference]: Without dead ends: 184 [2025-03-17 12:10:10,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 12:10:10,968 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 76 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:10,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 385 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:10:10,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-17 12:10:10,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 151. [2025-03-17 12:10:10,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 108 states have (on average 1.5925925925925926) internal successors, (172), 135 states have internal predecessors, (172), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 12:10:10,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 196 transitions. [2025-03-17 12:10:10,974 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 196 transitions. Word has length 21 [2025-03-17 12:10:10,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:10,975 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 196 transitions. [2025-03-17 12:10:10,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:10:10,975 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 196 transitions. [2025-03-17 12:10:10,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 12:10:10,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:10,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:10,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 12:10:10,977 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:10:10,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:10,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1843588308, now seen corresponding path program 1 times [2025-03-17 12:10:10,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:10,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20540213] [2025-03-17 12:10:10,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:10,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:10,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:10:10,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:10:10,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:10,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:11,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:11,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:11,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20540213] [2025-03-17 12:10:11,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20540213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:11,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:11,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:10:11,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460627994] [2025-03-17 12:10:11,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:11,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:10:11,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:11,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:10:11,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:10:11,036 INFO L87 Difference]: Start difference. First operand 151 states and 196 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:10:11,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:11,056 INFO L93 Difference]: Finished difference Result 159 states and 205 transitions. [2025-03-17 12:10:11,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:10:11,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-17 12:10:11,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:11,057 INFO L225 Difference]: With dead ends: 159 [2025-03-17 12:10:11,058 INFO L226 Difference]: Without dead ends: 159 [2025-03-17 12:10:11,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:10:11,058 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 3 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:11,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 385 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:10:11,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-17 12:10:11,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2025-03-17 12:10:11,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 111 states have (on average 1.5765765765765767) internal successors, (175), 140 states have internal predecessors, (175), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 12:10:11,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 203 transitions. [2025-03-17 12:10:11,063 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 203 transitions. Word has length 25 [2025-03-17 12:10:11,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:11,063 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 203 transitions. [2025-03-17 12:10:11,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:10:11,063 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 203 transitions. [2025-03-17 12:10:11,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 12:10:11,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:11,065 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:11,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 12:10:11,065 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:10:11,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:11,065 INFO L85 PathProgramCache]: Analyzing trace with hash 222165083, now seen corresponding path program 1 times [2025-03-17 12:10:11,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:11,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591703766] [2025-03-17 12:10:11,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:11,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:11,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:10:11,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:10:11,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:11,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:11,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:11,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:11,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591703766] [2025-03-17 12:10:11,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591703766] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:10:11,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578894730] [2025-03-17 12:10:11,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:11,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:10:11,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:10:11,141 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:10:11,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 12:10:11,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:10:11,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:10:11,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:11,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:11,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 12:10:11,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:10:11,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:11,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:10:11,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:11,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578894730] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:10:11,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:10:11,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-03-17 12:10:11,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508394229] [2025-03-17 12:10:11,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:10:11,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 12:10:11,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:11,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 12:10:11,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-17 12:10:11,386 INFO L87 Difference]: Start difference. First operand 157 states and 203 transitions. Second operand has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:10:11,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:11,747 INFO L93 Difference]: Finished difference Result 184 states and 218 transitions. [2025-03-17 12:10:11,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:10:11,747 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2025-03-17 12:10:11,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:11,748 INFO L225 Difference]: With dead ends: 184 [2025-03-17 12:10:11,748 INFO L226 Difference]: Without dead ends: 182 [2025-03-17 12:10:11,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2025-03-17 12:10:11,749 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 228 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:11,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 667 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:10:11,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-17 12:10:11,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 157. [2025-03-17 12:10:11,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 111 states have (on average 1.5675675675675675) internal successors, (174), 140 states have internal predecessors, (174), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 12:10:11,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 202 transitions. [2025-03-17 12:10:11,758 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 202 transitions. Word has length 24 [2025-03-17 12:10:11,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:11,758 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 202 transitions. [2025-03-17 12:10:11,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:10:11,758 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 202 transitions. [2025-03-17 12:10:11,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 12:10:11,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:11,760 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:11,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 12:10:11,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:10:11,961 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting is_list_containing_xErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:10:11,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:11,961 INFO L85 PathProgramCache]: Analyzing trace with hash -490504241, now seen corresponding path program 1 times [2025-03-17 12:10:11,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:11,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596183739] [2025-03-17 12:10:11,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:11,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:11,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:10:11,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:10:11,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:11,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:12,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:12,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:12,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596183739] [2025-03-17 12:10:12,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596183739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:10:12,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045263241] [2025-03-17 12:10:12,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:12,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:10:12,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:10:12,321 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:10:12,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 12:10:12,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:10:12,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:10:12,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:12,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:12,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-17 12:10:12,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:10:12,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 12:10:12,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 12:10:12,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-17 12:10:12,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-17 12:10:12,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:12,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:10:12,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2025-03-17 12:10:12,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:10:12,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:10:12,640 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:12,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045263241] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:10:12,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:10:12,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 19 [2025-03-17 12:10:12,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941841313] [2025-03-17 12:10:12,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:10:12,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 12:10:12,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:12,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 12:10:12,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2025-03-17 12:10:12,642 INFO L87 Difference]: Start difference. First operand 157 states and 202 transitions. Second operand has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 16 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:13,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:13,089 INFO L93 Difference]: Finished difference Result 234 states and 294 transitions. [2025-03-17 12:10:13,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 12:10:13,089 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 16 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-17 12:10:13,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:13,090 INFO L225 Difference]: With dead ends: 234 [2025-03-17 12:10:13,090 INFO L226 Difference]: Without dead ends: 234 [2025-03-17 12:10:13,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2025-03-17 12:10:13,091 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 322 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:13,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1024 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:10:13,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-17 12:10:13,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 195. [2025-03-17 12:10:13,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 141 states have (on average 1.553191489361702) internal successors, (219), 172 states have internal predecessors, (219), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 15 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 12:10:13,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 259 transitions. [2025-03-17 12:10:13,097 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 259 transitions. Word has length 25 [2025-03-17 12:10:13,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:13,097 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 259 transitions. [2025-03-17 12:10:13,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 16 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:10:13,097 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 259 transitions. [2025-03-17 12:10:13,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 12:10:13,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:13,098 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:13,104 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-03-17 12:10:13,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 12:10:13,302 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:10:13,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:13,302 INFO L85 PathProgramCache]: Analyzing trace with hash -2132071651, now seen corresponding path program 1 times [2025-03-17 12:10:13,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:13,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461645097] [2025-03-17 12:10:13,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:13,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:13,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:10:13,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:10:13,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:13,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:13,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:13,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:13,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461645097] [2025-03-17 12:10:13,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461645097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:13,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:13,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:10:13,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450952893] [2025-03-17 12:10:13,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:13,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:10:13,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:13,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:10:13,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:10:13,351 INFO L87 Difference]: Start difference. First operand 195 states and 259 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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-03-17 12:10:13,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:13,478 INFO L93 Difference]: Finished difference Result 208 states and 256 transitions. [2025-03-17 12:10:13,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:10:13,478 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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 27 [2025-03-17 12:10:13,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:13,479 INFO L225 Difference]: With dead ends: 208 [2025-03-17 12:10:13,479 INFO L226 Difference]: Without dead ends: 208 [2025-03-17 12:10:13,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:10:13,480 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 209 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:13,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 178 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:10:13,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-17 12:10:13,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 192. [2025-03-17 12:10:13,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 141 states have (on average 1.49645390070922) internal successors, (211), 169 states have internal predecessors, (211), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 15 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 12:10:13,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 251 transitions. [2025-03-17 12:10:13,490 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 251 transitions. Word has length 27 [2025-03-17 12:10:13,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:13,490 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 251 transitions. [2025-03-17 12:10:13,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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-03-17 12:10:13,491 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 251 transitions. [2025-03-17 12:10:13,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 12:10:13,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:13,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:13,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 12:10:13,492 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:10:13,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:13,493 INFO L85 PathProgramCache]: Analyzing trace with hash -2132071650, now seen corresponding path program 1 times [2025-03-17 12:10:13,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:13,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040078173] [2025-03-17 12:10:13,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:13,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:13,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:10:13,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:10:13,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:13,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:13,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:13,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:13,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040078173] [2025-03-17 12:10:13,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040078173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:13,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:13,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:10:13,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005670833] [2025-03-17 12:10:13,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:13,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:10:13,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:13,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:10:13,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:10:13,571 INFO L87 Difference]: Start difference. First operand 192 states and 251 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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-03-17 12:10:13,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:13,732 INFO L93 Difference]: Finished difference Result 205 states and 252 transitions. [2025-03-17 12:10:13,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:10:13,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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 27 [2025-03-17 12:10:13,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:13,734 INFO L225 Difference]: With dead ends: 205 [2025-03-17 12:10:13,734 INFO L226 Difference]: Without dead ends: 205 [2025-03-17 12:10:13,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:10:13,734 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 157 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:13,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 217 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:10:13,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-17 12:10:13,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 192. [2025-03-17 12:10:13,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 141 states have (on average 1.4680851063829787) internal successors, (207), 169 states have internal predecessors, (207), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 15 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 12:10:13,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 247 transitions. [2025-03-17 12:10:13,739 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 247 transitions. Word has length 27 [2025-03-17 12:10:13,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:13,739 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 247 transitions. [2025-03-17 12:10:13,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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-03-17 12:10:13,740 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 247 transitions. [2025-03-17 12:10:13,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 12:10:13,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:13,740 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:13,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 12:10:13,740 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:10:13,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:13,741 INFO L85 PathProgramCache]: Analyzing trace with hash -189858757, now seen corresponding path program 1 times [2025-03-17 12:10:13,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:13,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170941091] [2025-03-17 12:10:13,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:13,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:13,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 12:10:13,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 12:10:13,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:13,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:13,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:13,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:13,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170941091] [2025-03-17 12:10:13,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170941091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:13,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:13,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:10:13,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544465327] [2025-03-17 12:10:13,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:13,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:10:13,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:13,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:10:13,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:10:13,826 INFO L87 Difference]: Start difference. First operand 192 states and 247 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:10:13,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:13,969 INFO L93 Difference]: Finished difference Result 199 states and 244 transitions. [2025-03-17 12:10:13,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:10:13,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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 26 [2025-03-17 12:10:13,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:13,970 INFO L225 Difference]: With dead ends: 199 [2025-03-17 12:10:13,970 INFO L226 Difference]: Without dead ends: 199 [2025-03-17 12:10:13,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:10:13,970 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 66 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:13,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 301 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:10:13,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-17 12:10:13,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 186. [2025-03-17 12:10:13,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 141 states have (on average 1.4113475177304964) internal successors, (199), 163 states have internal predecessors, (199), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 15 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 12:10:13,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 239 transitions. [2025-03-17 12:10:13,975 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 239 transitions. Word has length 26 [2025-03-17 12:10:13,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:13,975 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 239 transitions. [2025-03-17 12:10:13,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:10:13,975 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 239 transitions. [2025-03-17 12:10:13,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 12:10:13,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:13,976 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:13,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 12:10:13,976 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:10:13,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:13,976 INFO L85 PathProgramCache]: Analyzing trace with hash -189858758, now seen corresponding path program 1 times [2025-03-17 12:10:13,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:13,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908379986] [2025-03-17 12:10:13,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:13,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:13,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 12:10:13,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 12:10:13,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:13,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:14,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:14,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:14,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908379986] [2025-03-17 12:10:14,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908379986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:14,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:14,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:10:14,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758002232] [2025-03-17 12:10:14,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:14,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:10:14,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:14,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:10:14,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:10:14,020 INFO L87 Difference]: Start difference. First operand 186 states and 239 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:10:14,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:14,156 INFO L93 Difference]: Finished difference Result 197 states and 242 transitions. [2025-03-17 12:10:14,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:10:14,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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 26 [2025-03-17 12:10:14,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:14,158 INFO L225 Difference]: With dead ends: 197 [2025-03-17 12:10:14,158 INFO L226 Difference]: Without dead ends: 197 [2025-03-17 12:10:14,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:10:14,159 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 71 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:14,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 292 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:10:14,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-17 12:10:14,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 185. [2025-03-17 12:10:14,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 141 states have (on average 1.3971631205673758) internal successors, (197), 162 states have internal predecessors, (197), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 15 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 12:10:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 237 transitions. [2025-03-17 12:10:14,169 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 237 transitions. Word has length 26 [2025-03-17 12:10:14,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:14,169 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 237 transitions. [2025-03-17 12:10:14,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:10:14,169 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 237 transitions. [2025-03-17 12:10:14,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 12:10:14,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:14,170 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:14,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 12:10:14,170 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:10:14,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:14,170 INFO L85 PathProgramCache]: Analyzing trace with hash 590719189, now seen corresponding path program 1 times [2025-03-17 12:10:14,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:14,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301405496] [2025-03-17 12:10:14,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:14,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:14,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:10:14,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:10:14,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:14,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:14,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:14,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:14,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301405496] [2025-03-17 12:10:14,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301405496] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:10:14,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660506454] [2025-03-17 12:10:14,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:14,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:10:14,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:10:14,349 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:10:14,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 12:10:14,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:10:14,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:10:14,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:14,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:14,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 12:10:14,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:10:14,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:10:14,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 12:10:14,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-17 12:10:14,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:14,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:10:14,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2025-03-17 12:10:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:14,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660506454] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:10:14,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:10:14,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 15 [2025-03-17 12:10:14,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338452420] [2025-03-17 12:10:14,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:10:14,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 12:10:14,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:14,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 12:10:14,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-17 12:10:14,663 INFO L87 Difference]: Start difference. First operand 185 states and 237 transitions. Second operand has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:10:15,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:15,186 INFO L93 Difference]: Finished difference Result 307 states and 370 transitions. [2025-03-17 12:10:15,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 12:10:15,186 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2025-03-17 12:10:15,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:15,187 INFO L225 Difference]: With dead ends: 307 [2025-03-17 12:10:15,188 INFO L226 Difference]: Without dead ends: 307 [2025-03-17 12:10:15,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2025-03-17 12:10:15,188 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 320 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:15,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 884 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 12:10:15,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-17 12:10:15,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 251. [2025-03-17 12:10:15,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 191 states have (on average 1.3717277486910995) internal successors, (262), 216 states have internal predecessors, (262), 31 states have call successors, (31), 12 states have call predecessors, (31), 12 states have return successors, (31), 22 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 12:10:15,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 324 transitions. [2025-03-17 12:10:15,198 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 324 transitions. Word has length 28 [2025-03-17 12:10:15,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:15,198 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 324 transitions. [2025-03-17 12:10:15,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:10:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 324 transitions. [2025-03-17 12:10:15,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 12:10:15,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:15,199 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:15,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 12:10:15,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:10:15,400 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:10:15,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:15,400 INFO L85 PathProgramCache]: Analyzing trace with hash 590719190, now seen corresponding path program 1 times [2025-03-17 12:10:15,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:15,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767627884] [2025-03-17 12:10:15,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:15,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:15,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:10:15,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:10:15,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:15,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:16,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:16,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:16,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767627884] [2025-03-17 12:10:16,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767627884] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:10:16,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711819205] [2025-03-17 12:10:16,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:16,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:10:16,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:10:16,007 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:10:16,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 12:10:16,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:10:16,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:10:16,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:16,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:16,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-17 12:10:16,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:10:16,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 12:10:16,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 12:10:16,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:10:16,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:10:16,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 12:10:16,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:10:16,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 12:10:16,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:10:16,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 12:10:16,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:10:16,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 12:10:16,269 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-03-17 12:10:16,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2025-03-17 12:10:16,282 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2025-03-17 12:10:16,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2025-03-17 12:10:16,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2025-03-17 12:10:16,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-17 12:10:16,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:16,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:10:17,302 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_696 (Array Int Int))) (< 0 (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_696))) (store .cse0 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 1))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (let ((.cse3 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_695))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 |c_ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0) (< 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_696))) (store .cse4 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 1))))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (let ((.cse7 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse5 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_696))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1))) (or (= .cse5 0) (< (+ .cse5 3) (select |c_#length| (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_695))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 |c_ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1))))))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (let ((.cse11 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse9 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_695))) (store .cse12 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse11 |c_ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1))) (or (= .cse9 0) (< (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_696))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse11 |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 3) (select |c_#length| .cse9)))))))) is different from false [2025-03-17 12:10:17,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:17,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 395 treesize of output 400 [2025-03-17 12:10:17,855 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_ArrVal_695 (Array Int Int))) (not (= |v_ULTIMATE.start_main_~n~0#1.base_28| (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_695) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_696))) (or (< (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 5) (= (select (select (store .cse1 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) 0)) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_prenex_1 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_3))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_28|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_695) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_696))) (or (< (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 5) (= (select (select (store .cse3 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) 0)) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_prenex_3 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_3) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0)) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (< (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_2))) (store .cse4 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) 0))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 5)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_prenex_8 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_8) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_1 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_3))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_28|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_695))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_28|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0))) (forall ((v_prenex_6 Int) (v_prenex_7 (Array Int Int))) (< 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_7))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_6 4) 0))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 1))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_ArrVal_696 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_696) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_695 (Array Int Int))) (= |v_ULTIMATE.start_main_~n~0#1.base_28| (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_695))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_28|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (< (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_2))) (store .cse9 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) 0))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 5)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (let ((.cse10 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_3) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0))) (or (= .cse10 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_695))) (store .cse11 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_28|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0)) (= .cse10 0)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int))) (<= 0 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_5))) (store .cse12 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_4 4) 0))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_prenex_8 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_8) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0)) (forall ((v_prenex_6 Int) (v_prenex_7 (Array Int Int))) (< 0 (+ (select (select (let ((.cse13 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_7))) (store .cse13 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_6 4) 0))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 1))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_1 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_695))) (or (= |v_ULTIMATE.start_main_~n~0#1.base_28| (select (select (store .cse14 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_28|)) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0)) (= (select (select (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_3))) (store .cse15 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_28|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) (select (select .cse14 |c_ULTIMATE.start_main_~x~0#1.base|) .cse0))))) (forall ((v_ArrVal_696 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_696) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_prenex_1 Int) (v_prenex_3 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_3))) (or (= |v_ULTIMATE.start_main_~n~0#1.base_28| (select (select (store .cse16 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_28|)) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0)) (= (select (select .cse16 |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_1 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_3))) (let ((.cse18 (select (select .cse17 |c_ULTIMATE.start_main_~x~0#1.base|) .cse0))) (or (= |v_ULTIMATE.start_main_~n~0#1.base_28| (select (select (store .cse17 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_28|)) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0)) (= .cse18 (select (select (let ((.cse19 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_695))) (store .cse19 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_28|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0)) (= .cse18 0))))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_696))) (or (< (select (select .cse20 |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 5) (= (select (select (store .cse20 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) 0)) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0)))))))) is different from false [2025-03-17 12:10:18,155 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_prenex_6 Int) (v_prenex_7 (Array Int Int))) (< 0 (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_7) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_6 4) 0) .cse0) 1))) (forall ((v_prenex_8 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_8) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 0)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_695 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_695) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_28|) .cse0) |v_ULTIMATE.start_main_~n~0#1.base_28|)) (forall ((v_ArrVal_696 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_696) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 0)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_696) |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (= (select (store .cse1 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) 0) .cse0) 0) (< (select .cse1 .cse0) 5)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_696) |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (= (select (store .cse2 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) 0) .cse0) 0) (< (select .cse2 .cse0) 5)))) (forall ((v_prenex_1 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_695) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) (select (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_3) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_28|) .cse0))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int))) (<= 0 (select (store (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_5) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_4 4) 0) .cse0))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_1 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_3) |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse3 (select .cse4 .cse0))) (or (= .cse3 (select (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_695) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_28|) .cse0)) (= |v_ULTIMATE.start_main_~n~0#1.base_28| (select (store .cse4 (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_28|) .cse0)) (= .cse3 0))))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_696) |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (= (select (store .cse5 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) 0) .cse0) 0) (< (select .cse5 .cse0) 5)))) (forall ((v_ArrVal_695 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_695) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) |v_ULTIMATE.start_main_~n~0#1.base_28|))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (< (select (store (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_2) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_1 4) 0) .cse0) 5)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_prenex_3 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_3) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 0)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_prenex_1 Int) (v_prenex_3 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_3) |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (= |v_ULTIMATE.start_main_~n~0#1.base_28| (select (store .cse6 (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_28|) .cse0)) (= (select .cse6 .cse0) 0)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (< (select (store (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_2) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_1 4) 0) .cse0) 5)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_3) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0))) (or (= .cse7 (select (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_695) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_28|) .cse0)) (= .cse7 0)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_ArrVal_696 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_696) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 0)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_1 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_695) |c_ULTIMATE.start_main_~#list~0#1.base|))) (or (= (select .cse8 .cse0) (select (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_3) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_28|) .cse0)) (= (select (store .cse8 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_28|) .cse0) |v_ULTIMATE.start_main_~n~0#1.base_28|)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_28| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_prenex_1 Int) (v_prenex_3 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_695) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_28|) .cse0) (select (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_3) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_28|) .cse0))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_28| 1)) (forall ((v_prenex_6 Int) (v_prenex_7 (Array Int Int))) (< 0 (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_7) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ v_prenex_6 4) 0) .cse0) 1))) (forall ((v_prenex_8 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_prenex_8) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) 0)))))) is different from false [2025-03-17 12:10:18,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:18,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-03-17 12:10:18,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2025-03-17 12:10:18,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-03-17 12:10:18,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2025-03-17 12:10:18,238 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-17 12:10:18,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 1 [2025-03-17 12:10:18,241 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:10:18,244 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:10:18,247 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:10:18,252 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-17 12:10:18,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 1 [2025-03-17 12:10:18,255 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:10:18,260 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-17 12:10:18,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 1 [2025-03-17 12:10:18,263 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:10:18,267 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-17 12:10:18,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 1 [2025-03-17 12:10:18,271 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:10:18,274 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:10:18,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-17 12:10:18,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711819205] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:10:18,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:10:18,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 11] total 35 [2025-03-17 12:10:18,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886590398] [2025-03-17 12:10:18,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:10:18,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-17 12:10:18,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:18,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-17 12:10:18,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=950, Unknown=3, NotChecked=192, Total=1260 [2025-03-17 12:10:18,298 INFO L87 Difference]: Start difference. First operand 251 states and 324 transitions. Second operand has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 36 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-03-17 12:10:21,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:21,676 INFO L93 Difference]: Finished difference Result 517 states and 638 transitions. [2025-03-17 12:10:21,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-17 12:10:21,676 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 36 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) Word has length 28 [2025-03-17 12:10:21,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:21,678 INFO L225 Difference]: With dead ends: 517 [2025-03-17 12:10:21,678 INFO L226 Difference]: Without dead ends: 517 [2025-03-17 12:10:21,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=666, Invalid=3003, Unknown=3, NotChecked=360, Total=4032 [2025-03-17 12:10:21,686 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 1303 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1303 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 2864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1200 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:21,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1303 Valid, 1124 Invalid, 2864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1436 Invalid, 0 Unknown, 1200 Unchecked, 1.4s Time] [2025-03-17 12:10:21,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-03-17 12:10:21,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 371. [2025-03-17 12:10:21,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 285 states have (on average 1.3333333333333333) internal successors, (380), 316 states have internal predecessors, (380), 49 states have call successors, (49), 20 states have call predecessors, (49), 20 states have return successors, (49), 34 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-17 12:10:21,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 478 transitions. [2025-03-17 12:10:21,696 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 478 transitions. Word has length 28 [2025-03-17 12:10:21,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:21,697 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 478 transitions. [2025-03-17 12:10:21,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 36 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-03-17 12:10:21,697 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 478 transitions. [2025-03-17 12:10:21,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 12:10:21,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:21,697 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:21,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 12:10:21,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:10:21,902 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:10:21,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:21,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1724796427, now seen corresponding path program 1 times [2025-03-17 12:10:21,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:21,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903742820] [2025-03-17 12:10:21,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:21,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:21,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:10:21,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:10:21,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:21,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:22,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:22,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:22,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903742820] [2025-03-17 12:10:22,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903742820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:22,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:22,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 12:10:22,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488160932] [2025-03-17 12:10:22,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:22,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:10:22,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:22,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:10:22,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:10:22,049 INFO L87 Difference]: Start difference. First operand 371 states and 478 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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-03-17 12:10:22,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:22,198 INFO L93 Difference]: Finished difference Result 406 states and 526 transitions. [2025-03-17 12:10:22,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:10:22,198 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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 30 [2025-03-17 12:10:22,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:22,199 INFO L225 Difference]: With dead ends: 406 [2025-03-17 12:10:22,199 INFO L226 Difference]: Without dead ends: 406 [2025-03-17 12:10:22,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 12:10:22,200 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 101 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:22,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 356 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:10:22,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-03-17 12:10:22,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 389. [2025-03-17 12:10:22,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 297 states have (on average 1.3265993265993266) internal successors, (394), 330 states have internal predecessors, (394), 55 states have call successors, (55), 20 states have call predecessors, (55), 20 states have return successors, (55), 38 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-17 12:10:22,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 504 transitions. [2025-03-17 12:10:22,209 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 504 transitions. Word has length 30 [2025-03-17 12:10:22,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:22,209 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 504 transitions. [2025-03-17 12:10:22,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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-03-17 12:10:22,209 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 504 transitions. [2025-03-17 12:10:22,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 12:10:22,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:22,209 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:22,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 12:10:22,210 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:10:22,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:22,210 INFO L85 PathProgramCache]: Analyzing trace with hash 589187933, now seen corresponding path program 1 times [2025-03-17 12:10:22,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:22,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763625647] [2025-03-17 12:10:22,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:22,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:22,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 12:10:22,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 12:10:22,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:22,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:22,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 12:10:22,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:22,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763625647] [2025-03-17 12:10:22,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763625647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:22,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:22,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:10:22,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268608881] [2025-03-17 12:10:22,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:22,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:10:22,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:22,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:10:22,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:10:22,242 INFO L87 Difference]: Start difference. First operand 389 states and 504 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:22,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:22,266 INFO L93 Difference]: Finished difference Result 385 states and 479 transitions. [2025-03-17 12:10:22,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:10:22,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2025-03-17 12:10:22,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:22,268 INFO L225 Difference]: With dead ends: 385 [2025-03-17 12:10:22,268 INFO L226 Difference]: Without dead ends: 385 [2025-03-17 12:10:22,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:10:22,269 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 38 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:22,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 253 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:10:22,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-17 12:10:22,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 371. [2025-03-17 12:10:22,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 291 states have (on average 1.3127147766323024) internal successors, (382), 318 states have internal predecessors, (382), 43 states have call successors, (43), 20 states have call predecessors, (43), 20 states have return successors, (43), 32 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-17 12:10:22,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 468 transitions. [2025-03-17 12:10:22,279 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 468 transitions. Word has length 31 [2025-03-17 12:10:22,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:22,280 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 468 transitions. [2025-03-17 12:10:22,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:10:22,280 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 468 transitions. [2025-03-17 12:10:22,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 12:10:22,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:22,280 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:22,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 12:10:22,281 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:10:22,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:22,281 INFO L85 PathProgramCache]: Analyzing trace with hash -803742028, now seen corresponding path program 1 times [2025-03-17 12:10:22,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:22,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822934751] [2025-03-17 12:10:22,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:22,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:22,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:10:22,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:10:22,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:22,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:22,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:22,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:22,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822934751] [2025-03-17 12:10:22,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822934751] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:10:22,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319897709] [2025-03-17 12:10:22,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:22,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:10:22,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:10:22,456 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:10:22,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 12:10:22,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:10:22,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:10:22,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:22,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:22,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-17 12:10:22,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:10:22,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:10:22,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:10:22,631 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:10:22,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-17 12:10:22,655 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:10:22,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-17 12:10:22,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:22,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:10:23,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:23,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 74 [2025-03-17 12:10:23,297 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-03-17 12:10:23,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 93 [2025-03-17 12:10:23,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:23,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 81 [2025-03-17 12:10:23,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2025-03-17 12:10:23,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 78 [2025-03-17 12:10:23,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2025-03-17 12:10:23,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:23,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 62 [2025-03-17 12:10:23,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:23,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319897709] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:10:23,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:10:23,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 31 [2025-03-17 12:10:23,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11304670] [2025-03-17 12:10:23,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:10:23,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-17 12:10:23,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:23,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-17 12:10:23,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=825, Unknown=3, NotChecked=0, Total=930 [2025-03-17 12:10:23,354 INFO L87 Difference]: Start difference. First operand 371 states and 468 transitions. Second operand has 31 states, 31 states have (on average 2.225806451612903) internal successors, (69), 30 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:10:24,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:24,501 INFO L93 Difference]: Finished difference Result 496 states and 626 transitions. [2025-03-17 12:10:24,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 12:10:24,502 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.225806451612903) internal successors, (69), 30 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2025-03-17 12:10:24,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:24,504 INFO L225 Difference]: With dead ends: 496 [2025-03-17 12:10:24,504 INFO L226 Difference]: Without dead ends: 490 [2025-03-17 12:10:24,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=265, Invalid=1712, Unknown=3, NotChecked=0, Total=1980 [2025-03-17 12:10:24,504 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 359 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 1596 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 1652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:24,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1514 Invalid, 1652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 12:10:24,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-03-17 12:10:24,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 394. [2025-03-17 12:10:24,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 306 states have (on average 1.3169934640522876) internal successors, (403), 337 states have internal predecessors, (403), 49 states have call successors, (49), 21 states have call predecessors, (49), 22 states have return successors, (53), 35 states have call predecessors, (53), 49 states have call successors, (53) [2025-03-17 12:10:24,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 505 transitions. [2025-03-17 12:10:24,513 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 505 transitions. Word has length 30 [2025-03-17 12:10:24,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:24,513 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 505 transitions. [2025-03-17 12:10:24,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.225806451612903) internal successors, (69), 30 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:10:24,513 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 505 transitions. [2025-03-17 12:10:24,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 12:10:24,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:24,514 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:24,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 12:10:24,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:10:24,715 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:10:24,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:24,715 INFO L85 PathProgramCache]: Analyzing trace with hash 765529832, now seen corresponding path program 1 times [2025-03-17 12:10:24,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:24,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387022051] [2025-03-17 12:10:24,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:24,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:24,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:10:24,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:10:24,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:24,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:25,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:25,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:25,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387022051] [2025-03-17 12:10:25,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387022051] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:10:25,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995437888] [2025-03-17 12:10:25,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:25,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:10:25,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:10:25,102 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:10:25,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 12:10:25,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:10:25,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:10:25,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:25,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:25,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-17 12:10:25,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:10:25,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:10:25,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:10:25,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 12:10:25,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 12:10:25,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:10:25,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:10:25,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:10:25,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:10:25,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:10:25,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:10:25,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:10:25,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:10:25,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:10:25,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 12:10:25,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:10:25,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 12:10:25,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:25,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:10:25,569 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~n~0#1.base_33| Int)) (or (forall ((v_ArrVal_885 Int) (v_ArrVal_882 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_33| v_ArrVal_882))) (store .cse0 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_ArrVal_885))) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_33| 1)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_33| Int)) (or (forall ((v_ArrVal_884 Int) (v_ArrVal_881 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_33| v_ArrVal_881))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_ArrVal_884))) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_33| 1)))))) is different from false [2025-03-17 12:10:27,047 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_14| Int)) (or (forall ((|v_ULTIMATE.start_main_~n~0#1.base_33| Int)) (or (forall ((v_ArrVal_882 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_33| v_ArrVal_882) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_33| 1)))) (< |v_ULTIMATE.start_main_~tail~0#1.offset_14| |c_ULTIMATE.start_main_~#list~0#1.offset|))) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_14| Int)) (or (forall ((|v_ULTIMATE.start_main_~n~0#1.base_33| Int)) (or (forall ((v_ArrVal_881 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_33| v_ArrVal_881) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_33| 1)))) (< |v_ULTIMATE.start_main_~tail~0#1.offset_14| |c_ULTIMATE.start_main_~#list~0#1.offset|)))) is different from false [2025-03-17 12:10:37,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:37,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2025-03-17 12:10:37,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2025-03-17 12:10:37,217 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-03-17 12:10:37,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 12:10:38,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-17 12:10:38,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995437888] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:10:38,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:10:38,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 24 [2025-03-17 12:10:38,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327128979] [2025-03-17 12:10:38,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:10:38,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 12:10:38,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:38,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 12:10:38,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=357, Unknown=20, NotChecked=82, Total=552 [2025-03-17 12:10:38,180 INFO L87 Difference]: Start difference. First operand 394 states and 505 transitions. Second operand has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:10:38,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:38,742 INFO L93 Difference]: Finished difference Result 455 states and 561 transitions. [2025-03-17 12:10:38,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 12:10:38,742 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-03-17 12:10:38,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:38,743 INFO L225 Difference]: With dead ends: 455 [2025-03-17 12:10:38,743 INFO L226 Difference]: Without dead ends: 455 [2025-03-17 12:10:38,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=203, Invalid=597, Unknown=20, NotChecked=110, Total=930 [2025-03-17 12:10:38,744 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 545 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 397 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:38,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 666 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 471 Invalid, 0 Unknown, 397 Unchecked, 0.4s Time] [2025-03-17 12:10:38,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-03-17 12:10:38,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 406. [2025-03-17 12:10:38,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 315 states have (on average 1.3047619047619048) internal successors, (411), 347 states have internal predecessors, (411), 50 states have call successors, (50), 23 states have call predecessors, (50), 24 states have return successors, (54), 35 states have call predecessors, (54), 50 states have call successors, (54) [2025-03-17 12:10:38,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 515 transitions. [2025-03-17 12:10:38,757 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 515 transitions. Word has length 30 [2025-03-17 12:10:38,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:38,758 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 515 transitions. [2025-03-17 12:10:38,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:10:38,758 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 515 transitions. [2025-03-17 12:10:38,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 12:10:38,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:38,759 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:38,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 12:10:38,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-17 12:10:38,960 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:10:38,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:38,960 INFO L85 PathProgramCache]: Analyzing trace with hash -327270038, now seen corresponding path program 1 times [2025-03-17 12:10:38,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:38,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262648042] [2025-03-17 12:10:38,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:38,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:38,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 12:10:38,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 12:10:38,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:38,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:39,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:39,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:39,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262648042] [2025-03-17 12:10:39,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262648042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:10:39,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:10:39,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:10:39,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119299322] [2025-03-17 12:10:39,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:10:39,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:10:39,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:10:39,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:10:39,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:10:39,041 INFO L87 Difference]: Start difference. First operand 406 states and 515 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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-03-17 12:10:39,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:10:39,167 INFO L93 Difference]: Finished difference Result 452 states and 573 transitions. [2025-03-17 12:10:39,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:10:39,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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 32 [2025-03-17 12:10:39,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:10:39,170 INFO L225 Difference]: With dead ends: 452 [2025-03-17 12:10:39,170 INFO L226 Difference]: Without dead ends: 452 [2025-03-17 12:10:39,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-17 12:10:39,170 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 34 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:10:39,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 380 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:10:39,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-03-17 12:10:39,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 432. [2025-03-17 12:10:39,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 336 states have (on average 1.2916666666666667) internal successors, (434), 368 states have internal predecessors, (434), 55 states have call successors, (55), 23 states have call predecessors, (55), 24 states have return successors, (60), 40 states have call predecessors, (60), 55 states have call successors, (60) [2025-03-17 12:10:39,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 549 transitions. [2025-03-17 12:10:39,180 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 549 transitions. Word has length 32 [2025-03-17 12:10:39,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:10:39,180 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 549 transitions. [2025-03-17 12:10:39,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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-03-17 12:10:39,181 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 549 transitions. [2025-03-17 12:10:39,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 12:10:39,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:10:39,181 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:10:39,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 12:10:39,181 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting is_list_containing_xErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:10:39,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:10:39,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1133209928, now seen corresponding path program 1 times [2025-03-17 12:10:39,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:10:39,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112139220] [2025-03-17 12:10:39,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:39,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:10:39,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 12:10:39,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 12:10:39,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:39,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 12:10:39,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:10:39,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112139220] [2025-03-17 12:10:39,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112139220] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:10:39,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843110383] [2025-03-17 12:10:39,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:10:39,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:10:39,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:10:39,387 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:10:39,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 12:10:39,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 12:10:39,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 12:10:39,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:10:39,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:10:39,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-03-17 12:10:39,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:10:39,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:10:39,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 12:10:39,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 12:10:39,567 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:10:39,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:10:39,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 12:10:39,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 12:10:39,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 12:10:39,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 12:10:39,655 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-03-17 12:10:39,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2025-03-17 12:10:39,674 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-03-17 12:10:39,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2025-03-17 12:10:39,791 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 12:10:39,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 12:10:39,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-03-17 12:10:39,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-03-17 12:10:39,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-03-17 12:10:39,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-03-17 12:10:39,907 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-03-17 12:10:39,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 21 [2025-03-17 12:10:39,919 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-03-17 12:10:39,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 21 [2025-03-17 12:10:40,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 28 [2025-03-17 12:10:40,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 12:10:40,357 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:10:40,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:10:40,557 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (forall ((v_ArrVal_1026 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1026))) (store .cse1 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse2 |c_ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3))) (or (= (select |c_#valid| .cse0) 1) (= .cse0 0)))) (or (forall ((v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1029 Int)) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1025))) (store .cse4 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse2 v_ArrVal_1029))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1026 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1026))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse2 |c_ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3)) 1))))) is different from false [2025-03-17 12:10:40,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:10:40,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 284 treesize of output 546 [2025-03-17 12:11:05,678 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~n~0#1.base_35| Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1016 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_prenex_30 Int) (v_prenex_32 Int) (v_ArrVal_1019 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1016))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|)) (.cse4 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse0 (select (select (store (store .cse2 |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1026) |c_ULTIMATE.start_main_~tail~0#1.base| (store (select (store (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse3 .cse4 v_ArrVal_1019)) |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1026) |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 |v_ULTIMATE.start_main_~n~0#1.base_35|)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5)) (.cse1 (select (select (store (store .cse2 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse3 .cse4 v_prenex_30)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (= .cse0 .cse1) (= |c_ULTIMATE.start_main_~tail~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_30) (= .cse0 v_prenex_30) (= (select (select (store (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse3 .cse4 v_prenex_32)) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) 0) (= v_prenex_30 .cse1)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_35| Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int)) (v_prenex_30 Int) (v_prenex_32 Int) (v_ArrVal_1018 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1016))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|)) (.cse9 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse6 (select (select (store (store .cse10 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~tail~0#1.base| (store (select (store (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse11 .cse9 v_prenex_32)) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~tail~0#1.base|) .cse9 v_prenex_30)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5)) (.cse7 (select (select (store (store .cse10 |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1026) |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse11 .cse9 |v_ULTIMATE.start_main_~n~0#1.base_35|)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (= |v_ULTIMATE.start_main_~n~0#1.base_35| .cse6) (= .cse7 .cse6) (= |v_ULTIMATE.start_main_~n~0#1.base_35| v_prenex_30) (= (select (select (store (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1017))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse9 v_ArrVal_1018))) |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1025) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) 0) (= .cse7 v_prenex_30) (= .cse7 |v_ULTIMATE.start_main_~n~0#1.base_35|) (= |v_ULTIMATE.start_main_~n~0#1.base_35| |c_ULTIMATE.start_main_~tail~0#1.base|) (= .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_35| Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1019 Int)) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1016))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~tail~0#1.base|)) (.cse16 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse12 (select (select (store (store .cse14 |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1026) |c_ULTIMATE.start_main_~tail~0#1.base| (store (select (store (store .cse14 |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse15 .cse16 v_ArrVal_1019)) |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1026) |c_ULTIMATE.start_main_~tail~0#1.base|) .cse16 |v_ULTIMATE.start_main_~n~0#1.base_35|)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (= .cse12 |c_ULTIMATE.start_main_~tail~0#1.base|) (forall ((v_prenex_30 Int)) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_30) (forall ((v_prenex_31 (Array Int Int)) (v_prenex_32 Int)) (let ((.cse13 (select (select (store (store .cse14 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse15 .cse16 v_prenex_30)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (= .cse12 .cse13) (= |c_ULTIMATE.start_main_~tail~0#1.base| .cse13) (= (select (select (store (store .cse14 |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse15 .cse16 v_prenex_32)) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) 0) (= v_prenex_30 .cse13))))))))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_35| Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1016 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_prenex_30 Int) (v_prenex_32 Int) (v_ArrVal_1019 Int)) (let ((.cse19 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1016))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~tail~0#1.base|)) (.cse21 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse18 (select (select (store (store .cse19 |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1026) |c_ULTIMATE.start_main_~tail~0#1.base| (store (select (store (store .cse19 |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse20 .cse21 v_ArrVal_1019)) |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1026) |c_ULTIMATE.start_main_~tail~0#1.base|) .cse21 |v_ULTIMATE.start_main_~n~0#1.base_35|)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5)) (.cse17 (select (select (store (store .cse19 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse20 .cse21 v_prenex_30)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| .cse17) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_30) (= .cse18 v_prenex_30) (= .cse18 |c_ULTIMATE.start_main_~tail~0#1.base|) (= (select (select (store (store .cse19 |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse20 .cse21 v_prenex_32)) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) 0) (= v_prenex_30 .cse17)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_35| Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_1018 Int)) (let ((.cse26 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1016))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~tail~0#1.base|)) (.cse23 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse25 (select (select (store (store .cse26 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse27 .cse23 v_prenex_30)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5)) (.cse24 (select (select (store (store .cse26 |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1026) |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse27 .cse23 |v_ULTIMATE.start_main_~n~0#1.base_35|)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_30) (= (select (select (store (let ((.cse22 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1017))) (store .cse22 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse23 v_ArrVal_1018))) |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1025) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) 0) (= .cse24 .cse25) (= |v_ULTIMATE.start_main_~n~0#1.base_35| .cse25) (= .cse24 |v_ULTIMATE.start_main_~n~0#1.base_35|) (= |v_ULTIMATE.start_main_~n~0#1.base_35| |c_ULTIMATE.start_main_~tail~0#1.base|) (= .cse24 |c_ULTIMATE.start_main_~tail~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_35| Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_1018 Int)) (let ((.cse28 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1016))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~tail~0#1.base|)) (.cse30 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse32 (select (select (store (store .cse28 |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1026) |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse29 .cse30 |v_ULTIMATE.start_main_~n~0#1.base_35|)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| (select (select (store (store .cse28 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse29 .cse30 v_prenex_30)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_30) (= (select (select (store (let ((.cse31 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1017))) (store .cse31 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse31 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse30 v_ArrVal_1018))) |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1025) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) 0) (= .cse32 |v_ULTIMATE.start_main_~n~0#1.base_35|) (= |v_ULTIMATE.start_main_~n~0#1.base_35| |c_ULTIMATE.start_main_~tail~0#1.base|) (= .cse32 |c_ULTIMATE.start_main_~tail~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_35| Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int)) (v_prenex_30 Int) (v_prenex_32 Int) (v_ArrVal_1018 Int)) (let ((.cse35 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1016))) (let ((.cse36 (select .cse35 |c_ULTIMATE.start_main_~tail~0#1.base|)) (.cse34 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse37 (select (select (store (store .cse35 |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1026) |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse36 .cse34 |v_ULTIMATE.start_main_~n~0#1.base_35|)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (= |v_ULTIMATE.start_main_~n~0#1.base_35| v_prenex_30) (= (select (select (store (let ((.cse33 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1017))) (store .cse33 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse33 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse34 v_ArrVal_1018))) |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1025) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| (select (select (store (store .cse35 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~tail~0#1.base| (store (select (store (store .cse35 |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse36 .cse34 v_prenex_32)) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~tail~0#1.base|) .cse34 v_prenex_30)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5)) (= .cse37 v_prenex_30) (= .cse37 |v_ULTIMATE.start_main_~n~0#1.base_35|) (= |v_ULTIMATE.start_main_~n~0#1.base_35| |c_ULTIMATE.start_main_~tail~0#1.base|) (= .cse37 |c_ULTIMATE.start_main_~tail~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_35| Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1019 Int)) (let ((.cse38 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1016))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_main_~tail~0#1.base|)) (.cse40 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (= (select (select (store (store .cse38 |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1026) |c_ULTIMATE.start_main_~tail~0#1.base| (store (select (store (store .cse38 |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse39 .cse40 v_ArrVal_1019)) |v_ULTIMATE.start_main_~n~0#1.base_35| v_ArrVal_1026) |c_ULTIMATE.start_main_~tail~0#1.base|) .cse40 |v_ULTIMATE.start_main_~n~0#1.base_35|)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) |c_ULTIMATE.start_main_~tail~0#1.base|) (forall ((v_prenex_30 Int)) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_30) (forall ((v_prenex_31 (Array Int Int)) (v_prenex_32 Int)) (let ((.cse41 (select (select (store (store .cse38 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse39 .cse40 v_prenex_30)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| .cse41) (= (select (select (store (store .cse38 |c_ULTIMATE.start_main_~tail~0#1.base| (store .cse39 .cse40 v_prenex_32)) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) 0) (= v_prenex_30 .cse41)))))))))))) is different from false [2025-03-17 12:11:15,812 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:11:15,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:15,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-03-17 12:11:15,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:15,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 73 [2025-03-17 12:11:15,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 104 [2025-03-17 12:11:15,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 67 [2025-03-17 12:11:15,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 69 [2025-03-17 12:11:15,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2025-03-17 12:11:15,850 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:11:15,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-03-17 12:11:15,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:11:15,862 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:11:15,866 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:11:15,871 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-17 12:11:15,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 1 [2025-03-17 12:11:15,874 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:11:15,875 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:11:15,879 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-17 12:11:15,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 1 [2025-03-17 12:11:15,882 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:11:15,882 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:11:15,887 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-17 12:11:15,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 1 [2025-03-17 12:11:15,890 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:11:15,890 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:11:15,895 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-17 12:11:15,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 1 [2025-03-17 12:11:15,899 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:11:15,905 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-17 12:11:15,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 1 [2025-03-17 12:11:15,908 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:11:15,909 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:11:15,914 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-17 12:11:15,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 1 [2025-03-17 12:11:16,049 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-03-17 12:11:16,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843110383] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:11:16,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:11:16,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 16] total 38 [2025-03-17 12:11:16,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903356236] [2025-03-17 12:11:16,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:11:16,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-17 12:11:16,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:11:16,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-17 12:11:16,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1244, Unknown=26, NotChecked=146, Total=1560 [2025-03-17 12:11:16,050 INFO L87 Difference]: Start difference. First operand 432 states and 549 transitions. Second operand has 40 states, 37 states have (on average 2.4324324324324325) internal successors, (90), 34 states have internal predecessors, (90), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:23,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:11:23,059 INFO L93 Difference]: Finished difference Result 473 states and 594 transitions. [2025-03-17 12:11:23,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 12:11:23,059 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 2.4324324324324325) internal successors, (90), 34 states have internal predecessors, (90), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-17 12:11:23,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:11:23,060 INFO L225 Difference]: With dead ends: 473 [2025-03-17 12:11:23,060 INFO L226 Difference]: Without dead ends: 471 [2025-03-17 12:11:23,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 35.3s TimeCoverageRelationStatistics Valid=336, Invalid=2508, Unknown=26, NotChecked=210, Total=3080 [2025-03-17 12:11:23,061 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 685 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 1634 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 2135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 364 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:11:23,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 1037 Invalid, 2135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1634 Invalid, 0 Unknown, 364 Unchecked, 5.0s Time] [2025-03-17 12:11:23,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-03-17 12:11:23,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 450. [2025-03-17 12:11:23,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 350 states have (on average 1.2885714285714285) internal successors, (451), 382 states have internal predecessors, (451), 57 states have call successors, (57), 25 states have call predecessors, (57), 26 states have return successors, (62), 42 states have call predecessors, (62), 57 states have call successors, (62) [2025-03-17 12:11:23,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 570 transitions. [2025-03-17 12:11:23,069 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 570 transitions. Word has length 34 [2025-03-17 12:11:23,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:11:23,069 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 570 transitions. [2025-03-17 12:11:23,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 2.4324324324324325) internal successors, (90), 34 states have internal predecessors, (90), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:23,069 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 570 transitions. [2025-03-17 12:11:23,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 12:11:23,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:11:23,070 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:11:23,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 12:11:23,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-17 12:11:23,274 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting is_list_containing_xErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:11:23,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:11:23,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1133209929, now seen corresponding path program 1 times [2025-03-17 12:11:23,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:11:23,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636349515] [2025-03-17 12:11:23,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:23,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:11:23,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 12:11:23,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 12:11:23,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:23,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:23,625 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:23,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:11:23,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636349515] [2025-03-17 12:11:23,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636349515] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:11:23,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522785412] [2025-03-17 12:11:23,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:23,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:11:23,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:11:23,628 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:11:23,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 12:11:23,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 12:11:23,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 12:11:23,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:23,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:23,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-17 12:11:23,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:11:23,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:11:23,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 12:11:23,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 12:11:23,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-17 12:11:24,017 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:24,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:11:24,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2025-03-17 12:11:24,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:11:24,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:11:24,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:11:24,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:11:24,240 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 12:11:24,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522785412] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:11:24,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:11:24,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 29 [2025-03-17 12:11:24,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220156231] [2025-03-17 12:11:24,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:11:24,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-17 12:11:24,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:11:24,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 12:11:24,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2025-03-17 12:11:24,241 INFO L87 Difference]: Start difference. First operand 450 states and 570 transitions. Second operand has 30 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 24 states have internal predecessors, (90), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:24,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:11:24,950 INFO L93 Difference]: Finished difference Result 468 states and 588 transitions. [2025-03-17 12:11:24,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 12:11:24,950 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 24 states have internal predecessors, (90), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-17 12:11:24,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:11:24,952 INFO L225 Difference]: With dead ends: 468 [2025-03-17 12:11:24,952 INFO L226 Difference]: Without dead ends: 468 [2025-03-17 12:11:24,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=1097, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 12:11:24,952 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 254 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 12:11:24,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 976 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 12:11:24,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-17 12:11:24,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 450. [2025-03-17 12:11:24,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 350 states have (on average 1.2857142857142858) internal successors, (450), 382 states have internal predecessors, (450), 57 states have call successors, (57), 25 states have call predecessors, (57), 26 states have return successors, (62), 42 states have call predecessors, (62), 57 states have call successors, (62) [2025-03-17 12:11:24,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 569 transitions. [2025-03-17 12:11:24,959 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 569 transitions. Word has length 34 [2025-03-17 12:11:24,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:11:24,959 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 569 transitions. [2025-03-17 12:11:24,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 24 states have internal predecessors, (90), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:24,959 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 569 transitions. [2025-03-17 12:11:24,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 12:11:24,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:11:24,960 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:11:24,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 12:11:25,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-17 12:11:25,160 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:11:25,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:11:25,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1317425305, now seen corresponding path program 1 times [2025-03-17 12:11:25,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:11:25,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131645011] [2025-03-17 12:11:25,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:25,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:11:25,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 12:11:25,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 12:11:25,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:25,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:25,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:25,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:11:25,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131645011] [2025-03-17 12:11:25,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131645011] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:11:25,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81195844] [2025-03-17 12:11:25,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:25,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:11:25,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:11:25,659 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:11:25,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 12:11:25,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 12:11:25,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 12:11:25,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:25,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:25,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-17 12:11:25,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:11:25,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:11:25,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:11:25,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 12:11:25,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 12:11:25,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:11:25,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:11:25,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:11:25,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:11:25,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:11:25,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:11:25,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:11:25,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:11:25,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:11:25,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 12:11:25,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:11:25,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 12:11:26,039 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-17 12:11:26,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-03-17 12:11:26,050 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-17 12:11:26,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-03-17 12:11:26,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:26,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:11:26,258 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4))) (and (forall ((v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1237 Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1233))) (store .cse0 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_ArrVal_1237))) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (forall ((v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1238 Int)) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1234))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_ArrVal_1238))) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)))) is different from false [2025-03-17 12:11:28,143 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_17| Int)) (or (< |v_ULTIMATE.start_main_~tail~0#1.offset_17| |c_ULTIMATE.start_main_~#list~0#1.offset|) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_43| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_43| 1)) (forall ((v_ArrVal_1234 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_43| v_ArrVal_1234) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0)))))) (forall ((|v_ULTIMATE.start_main_~tail~0#1.offset_17| Int)) (or (< |v_ULTIMATE.start_main_~tail~0#1.offset_17| |c_ULTIMATE.start_main_~#list~0#1.offset|) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_43| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_43| 1)) (forall ((v_ArrVal_1233 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~n~0#1.base_43| v_ArrVal_1233) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0))))))) is different from false [2025-03-17 12:11:37,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:37,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2025-03-17 12:11:37,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2025-03-17 12:11:37,286 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-03-17 12:11:37,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 12:11:38,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:38,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81195844] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:11:38,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:11:38,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 26 [2025-03-17 12:11:38,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798334784] [2025-03-17 12:11:38,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:11:38,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 12:11:38,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:11:38,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 12:11:38,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=442, Unknown=17, NotChecked=90, Total=650 [2025-03-17 12:11:38,740 INFO L87 Difference]: Start difference. First operand 450 states and 569 transitions. Second operand has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 states have internal predecessors, (61), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:11:39,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:11:39,443 INFO L93 Difference]: Finished difference Result 489 states and 596 transitions. [2025-03-17 12:11:39,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 12:11:39,443 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 states have internal predecessors, (61), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2025-03-17 12:11:39,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:11:39,445 INFO L225 Difference]: With dead ends: 489 [2025-03-17 12:11:39,445 INFO L226 Difference]: Without dead ends: 489 [2025-03-17 12:11:39,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=239, Invalid=744, Unknown=17, NotChecked=122, Total=1122 [2025-03-17 12:11:39,446 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 631 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 364 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 12:11:39,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 776 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 528 Invalid, 0 Unknown, 364 Unchecked, 0.4s Time] [2025-03-17 12:11:39,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-03-17 12:11:39,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 351. [2025-03-17 12:11:39,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 268 states have (on average 1.3022388059701493) internal successors, (349), 297 states have internal predecessors, (349), 45 states have call successors, (45), 20 states have call predecessors, (45), 21 states have return successors, (50), 33 states have call predecessors, (50), 45 states have call successors, (50) [2025-03-17 12:11:39,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 444 transitions. [2025-03-17 12:11:39,453 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 444 transitions. Word has length 33 [2025-03-17 12:11:39,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:11:39,453 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 444 transitions. [2025-03-17 12:11:39,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 states have internal predecessors, (61), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 12:11:39,453 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 444 transitions. [2025-03-17 12:11:39,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 12:11:39,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:11:39,454 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:11:39,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 12:11:39,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:11:39,655 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-03-17 12:11:39,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:11:39,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1219718424, now seen corresponding path program 1 times [2025-03-17 12:11:39,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:11:39,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996332604] [2025-03-17 12:11:39,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:39,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:11:39,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 12:11:39,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 12:11:39,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:39,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:39,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:11:39,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:11:39,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996332604] [2025-03-17 12:11:39,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996332604] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:11:39,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071431173] [2025-03-17 12:11:39,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:39,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:11:39,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:11:39,942 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:11:39,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 12:11:40,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 12:11:40,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 12:11:40,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:40,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:40,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-17 12:11:40,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:11:40,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 12:11:40,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 12:11:40,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:11:40,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 12:11:40,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:11:40,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 12:11:40,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:11:40,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:11:40,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071431173] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:11:40,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:11:40,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 28 [2025-03-17 12:11:40,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609700387] [2025-03-17 12:11:40,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:11:40,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 12:11:40,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:11:40,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 12:11:40,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2025-03-17 12:11:40,684 INFO L87 Difference]: Start difference. First operand 351 states and 444 transitions. Second operand has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)