./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/list-ext3-properties/sll_length_check-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/list-ext3-properties/sll_length_check-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7e94c5e9dacbd39c649745e41bbd45c5a575b10e3c88caa5356cae0ca64a0689 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:18:17,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:18:17,689 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:18:17,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:18:17,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:18:17,716 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:18:17,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:18:17,717 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:18:17,717 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:18:17,717 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:18:17,718 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:18:17,718 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:18:17,718 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:18:17,718 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:18:17,718 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:18:17,718 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:18:17,719 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:18:17,719 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:18:17,719 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:18:17,719 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:18:17,719 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:18:17,719 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:18:17,719 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:18:17,719 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:18:17,719 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:18:17,719 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:18:17,720 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:18:17,720 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:18:17,720 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:18:17,720 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:18:17,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:18:17,720 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:18:17,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:18:17,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:18:17,721 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:18:17,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:18:17,721 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:18:17,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:18:17,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:18:17,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:18:17,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:18:17,721 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:18:17,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:18:17,721 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:18:17,721 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:18:17,721 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:18:17,722 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 -> 7e94c5e9dacbd39c649745e41bbd45c5a575b10e3c88caa5356cae0ca64a0689 [2025-04-29 11:18:17,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:18:17,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:18:17,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:18:17,932 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:18:17,933 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:18:17,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_length_check-2.c [2025-04-29 11:18:19,144 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3d800442/78e43aa6b3674bd8964fcd9ab83d8c75/FLAGf8c57c822 [2025-04-29 11:18:19,345 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:18:19,345 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_length_check-2.c [2025-04-29 11:18:19,346 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:18:19,346 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:18:19,351 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3d800442/78e43aa6b3674bd8964fcd9ab83d8c75/FLAGf8c57c822 [2025-04-29 11:18:20,194 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3d800442/78e43aa6b3674bd8964fcd9ab83d8c75 [2025-04-29 11:18:20,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:18:20,197 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:18:20,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:18:20,198 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:18:20,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:18:20,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:18:20" (1/1) ... [2025-04-29 11:18:20,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5515464f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:18:20, skipping insertion in model container [2025-04-29 11:18:20,203 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:18:20" (1/1) ... [2025-04-29 11:18:20,212 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:18:20,369 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:18:20,374 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:18:20,400 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:18:20,413 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:18:20,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:18:20 WrapperNode [2025-04-29 11:18:20,415 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:18:20,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:18:20,415 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:18:20,415 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:18:20,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:18:20" (1/1) ... [2025-04-29 11:18:20,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:18:20" (1/1) ... [2025-04-29 11:18:20,438 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 79 [2025-04-29 11:18:20,439 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:18:20,439 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:18:20,439 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:18:20,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:18:20,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:18:20" (1/1) ... [2025-04-29 11:18:20,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:18:20" (1/1) ... [2025-04-29 11:18:20,445 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:18:20" (1/1) ... [2025-04-29 11:18:20,461 INFO L175 MemorySlicer]: Split 3 memory accesses to 1 slices as follows [3]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 1 writes are split as follows [1]. [2025-04-29 11:18:20,461 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:18:20" (1/1) ... [2025-04-29 11:18:20,461 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:18:20" (1/1) ... [2025-04-29 11:18:20,465 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:18:20" (1/1) ... [2025-04-29 11:18:20,465 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:18:20" (1/1) ... [2025-04-29 11:18:20,467 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:18:20" (1/1) ... [2025-04-29 11:18:20,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:18:20" (1/1) ... [2025-04-29 11:18:20,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:18:20" (1/1) ... [2025-04-29 11:18:20,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:18:20,472 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:18:20,472 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:18:20,472 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:18:20,473 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:18:20" (1/1) ... [2025-04-29 11:18:20,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:18:20,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:18:20,500 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:18:20,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:18:20,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:18:20,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:18:20,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:18:20,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:18:20,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:18:20,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:18:20,565 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:18:20,566 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:18:20,707 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2025-04-29 11:18:20,708 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:18:20,716 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:18:20,717 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-29 11:18:20,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:18:20 BoogieIcfgContainer [2025-04-29 11:18:20,718 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:18:20,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:18:20,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:18:20,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:18:20,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:18:20" (1/3) ... [2025-04-29 11:18:20,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f2cd814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:18:20, skipping insertion in model container [2025-04-29 11:18:20,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:18:20" (2/3) ... [2025-04-29 11:18:20,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f2cd814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:18:20, skipping insertion in model container [2025-04-29 11:18:20,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:18:20" (3/3) ... [2025-04-29 11:18:20,726 INFO L128 eAbstractionObserver]: Analyzing ICFG sll_length_check-2.c [2025-04-29 11:18:20,737 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:18:20,739 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll_length_check-2.c that has 1 procedures, 40 locations, 47 edges, 1 initial locations, 4 loop locations, and 10 error locations. [2025-04-29 11:18:20,773 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:18:20,783 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4c016d2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:18:20,783 INFO L341 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-04-29 11:18:20,786 INFO L278 IsEmpty]: Start isEmpty. Operand has 40 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 39 states have internal predecessors, (47), 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-04-29 11:18:20,790 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:18:20,790 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:18:20,790 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:18:20,791 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:18:20,795 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:18:20,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1820174777, now seen corresponding path program 1 times [2025-04-29 11:18:20,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:18:20,802 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062183927] [2025-04-29 11:18:20,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:20,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:18:20,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:18:20,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:18:20,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:20,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:20,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:18:20,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:18:20,886 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062183927] [2025-04-29 11:18:20,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062183927] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:18:20,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:18:20,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:18:20,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628982234] [2025-04-29 11:18:20,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:18:20,891 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-29 11:18:20,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:18:20,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-29 11:18:20,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 11:18:20,912 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 39 states have internal predecessors, (47), 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) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-04-29 11:18:20,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:18:20,926 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2025-04-29 11:18:20,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-29 11:18:20,927 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-04-29 11:18:20,927 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:18:20,931 INFO L225 Difference]: With dead ends: 39 [2025-04-29 11:18:20,931 INFO L226 Difference]: Without dead ends: 35 [2025-04-29 11:18:20,932 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 11:18:20,936 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:18:20,937 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:18:20,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-04-29 11:18:20,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-04-29 11:18:20,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.56) internal successors, (39), 34 states have internal predecessors, (39), 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-04-29 11:18:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2025-04-29 11:18:20,963 INFO L79 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 7 [2025-04-29 11:18:20,963 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:18:20,964 INFO L485 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2025-04-29 11:18:20,964 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-04-29 11:18:20,964 INFO L278 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2025-04-29 11:18:20,964 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:18:20,964 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:18:20,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:18:20,964 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:18:20,965 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:18:20,965 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:18:20,966 INFO L85 PathProgramCache]: Analyzing trace with hash 298269074, now seen corresponding path program 1 times [2025-04-29 11:18:20,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:18:20,966 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518949632] [2025-04-29 11:18:20,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:20,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:18:20,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:18:20,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:18:20,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:20,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:21,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-04-29 11:18:21,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:18:21,035 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518949632] [2025-04-29 11:18:21,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518949632] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:18:21,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:18:21,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:18:21,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529635328] [2025-04-29 11:18:21,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:18:21,036 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:18:21,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:18:21,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:18:21,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:18:21,036 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-04-29 11:18:21,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:18:21,063 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2025-04-29 11:18:21,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:18:21,063 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2025-04-29 11:18:21,063 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:18:21,064 INFO L225 Difference]: With dead ends: 34 [2025-04-29 11:18:21,064 INFO L226 Difference]: Without dead ends: 34 [2025-04-29 11:18:21,064 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:18:21,064 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:18:21,065 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 56 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:18:21,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-04-29 11:18:21,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-04-29 11:18:21,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.52) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:18:21,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-04-29 11:18:21,069 INFO L79 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 9 [2025-04-29 11:18:21,069 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:18:21,069 INFO L485 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-04-29 11:18:21,069 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-04-29 11:18:21,069 INFO L278 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-04-29 11:18:21,069 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:18:21,070 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:18:21,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:18:21,070 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:18:21,070 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:18:21,070 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:18:21,071 INFO L85 PathProgramCache]: Analyzing trace with hash 298269075, now seen corresponding path program 1 times [2025-04-29 11:18:21,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:18:21,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360235160] [2025-04-29 11:18:21,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:21,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:18:21,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:18:21,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:18:21,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:21,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:18:21,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:18:21,160 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360235160] [2025-04-29 11:18:21,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360235160] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:18:21,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:18:21,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:18:21,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411492356] [2025-04-29 11:18:21,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:18:21,161 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:18:21,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:18:21,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:18:21,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:18:21,162 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-04-29 11:18:21,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:18:21,179 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2025-04-29 11:18:21,180 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:18:21,180 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2025-04-29 11:18:21,181 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:18:21,181 INFO L225 Difference]: With dead ends: 33 [2025-04-29 11:18:21,181 INFO L226 Difference]: Without dead ends: 33 [2025-04-29 11:18:21,181 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:18:21,181 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:18:21,182 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:18:21,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-04-29 11:18:21,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-04-29 11:18:21,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.48) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:18:21,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2025-04-29 11:18:21,185 INFO L79 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 9 [2025-04-29 11:18:21,185 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:18:21,185 INFO L485 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2025-04-29 11:18:21,185 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-04-29 11:18:21,186 INFO L278 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2025-04-29 11:18:21,186 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:18:21,186 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:18:21,186 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:18:21,187 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:18:21,187 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:18:21,189 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:18:21,189 INFO L85 PathProgramCache]: Analyzing trace with hash 656802992, now seen corresponding path program 1 times [2025-04-29 11:18:21,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:18:21,189 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330735195] [2025-04-29 11:18:21,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:21,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:18:21,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:18:21,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:18:21,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:21,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:21,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:18:21,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:18:21,290 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330735195] [2025-04-29 11:18:21,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330735195] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:18:21,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:18:21,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:18:21,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59537113] [2025-04-29 11:18:21,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:18:21,291 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:18:21,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:18:21,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:18:21,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:18:21,292 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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-04-29 11:18:21,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:18:21,322 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-04-29 11:18:21,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:18:21,323 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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-04-29 11:18:21,323 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:18:21,324 INFO L225 Difference]: With dead ends: 38 [2025-04-29 11:18:21,324 INFO L226 Difference]: Without dead ends: 38 [2025-04-29 11:18:21,324 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:18:21,324 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:18:21,325 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 123 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:18:21,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-29 11:18:21,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-04-29 11:18:21,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 35 states have internal predecessors, (41), 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-04-29 11:18:21,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2025-04-29 11:18:21,330 INFO L79 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 10 [2025-04-29 11:18:21,330 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:18:21,330 INFO L485 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2025-04-29 11:18:21,330 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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-04-29 11:18:21,330 INFO L278 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2025-04-29 11:18:21,330 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 11:18:21,330 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:18:21,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:18:21,330 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:18:21,330 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:18:21,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:18:21,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1047287315, now seen corresponding path program 1 times [2025-04-29 11:18:21,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:18:21,331 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674683506] [2025-04-29 11:18:21,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:21,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:18:21,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:18:21,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:18:21,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:21,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:21,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:18:21,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:18:21,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674683506] [2025-04-29 11:18:21,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674683506] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:18:21,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:18:21,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:18:21,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290331345] [2025-04-29 11:18:21,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:18:21,395 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:18:21,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:18:21,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:18:21,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:18:21,396 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-04-29 11:18:21,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:18:21,421 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2025-04-29 11:18:21,421 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:18:21,422 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2025-04-29 11:18:21,422 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:18:21,422 INFO L225 Difference]: With dead ends: 37 [2025-04-29 11:18:21,422 INFO L226 Difference]: Without dead ends: 37 [2025-04-29 11:18:21,422 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:18:21,423 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 22 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:18:21,424 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 59 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:18:21,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-04-29 11:18:21,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2025-04-29 11:18:21,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:18:21,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-04-29 11:18:21,426 INFO L79 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 13 [2025-04-29 11:18:21,426 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:18:21,426 INFO L485 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-04-29 11:18:21,426 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-04-29 11:18:21,426 INFO L278 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-04-29 11:18:21,427 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:18:21,427 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:18:21,427 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:18:21,427 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:18:21,427 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:18:21,427 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:18:21,427 INFO L85 PathProgramCache]: Analyzing trace with hash 812476537, now seen corresponding path program 1 times [2025-04-29 11:18:21,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:18:21,429 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854503746] [2025-04-29 11:18:21,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:21,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:18:21,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:18:21,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:18:21,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:21,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:21,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:18:21,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:18:21,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854503746] [2025-04-29 11:18:21,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854503746] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:18:21,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:18:21,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:18:21,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732840954] [2025-04-29 11:18:21,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:18:21,526 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:18:21,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:18:21,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:18:21,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:18:21,526 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:18:21,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:18:21,606 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2025-04-29 11:18:21,606 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:18:21,607 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-29 11:18:21,607 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:18:21,607 INFO L225 Difference]: With dead ends: 38 [2025-04-29 11:18:21,607 INFO L226 Difference]: Without dead ends: 38 [2025-04-29 11:18:21,607 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:18:21,608 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:18:21,608 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 99 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:18:21,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-29 11:18:21,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-04-29 11:18:21,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.5) internal successors, (42), 35 states have internal predecessors, (42), 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-04-29 11:18:21,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-04-29 11:18:21,614 INFO L79 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 14 [2025-04-29 11:18:21,614 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:18:21,614 INFO L485 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-04-29 11:18:21,614 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:18:21,614 INFO L278 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2025-04-29 11:18:21,614 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:18:21,614 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:18:21,614 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:18:21,615 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:18:21,615 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:18:21,615 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:18:21,615 INFO L85 PathProgramCache]: Analyzing trace with hash 812476538, now seen corresponding path program 1 times [2025-04-29 11:18:21,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:18:21,615 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183802745] [2025-04-29 11:18:21,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:21,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:18:21,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:18:21,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:18:21,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:21,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:18:21,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:18:21,666 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183802745] [2025-04-29 11:18:21,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183802745] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:18:21,666 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228232590] [2025-04-29 11:18:21,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:21,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:18:21,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:18:21,668 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:18:21,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:18:21,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:18:21,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:18:21,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:21,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:21,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:18:21,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:18:21,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:18:21,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:18:21,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:18:21,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228232590] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:18:21,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:18:21,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-04-29 11:18:21,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569844390] [2025-04-29 11:18:21,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:18:21,766 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:18:21,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:18:21,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:18:21,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:18:21,766 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:18:21,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:18:21,793 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2025-04-29 11:18:21,794 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:18:21,794 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-29 11:18:21,794 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:18:21,794 INFO L225 Difference]: With dead ends: 40 [2025-04-29 11:18:21,794 INFO L226 Difference]: Without dead ends: 40 [2025-04-29 11:18:21,794 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:18:21,795 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 24 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:18:21,795 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 102 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:18:21,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-04-29 11:18:21,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-04-29 11:18:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.4375) internal successors, (46), 39 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:18:21,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2025-04-29 11:18:21,797 INFO L79 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 14 [2025-04-29 11:18:21,797 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:18:21,797 INFO L485 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-04-29 11:18:21,797 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:18:21,797 INFO L278 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2025-04-29 11:18:21,797 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:18:21,797 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:18:21,797 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:18:21,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 11:18:21,999 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:18:21,999 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:18:22,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:18:22,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1134837821, now seen corresponding path program 2 times [2025-04-29 11:18:22,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:18:22,000 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549758368] [2025-04-29 11:18:22,000 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:18:22,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:18:22,008 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-29 11:18:22,015 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:18:22,015 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:18:22,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:22,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:18:22,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:18:22,149 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549758368] [2025-04-29 11:18:22,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549758368] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:18:22,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:18:22,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:18:22,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232272468] [2025-04-29 11:18:22,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:18:22,149 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:18:22,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:18:22,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:18:22,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:18:22,150 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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-04-29 11:18:22,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:18:22,205 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2025-04-29 11:18:22,206 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:18:22,206 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2025-04-29 11:18:22,206 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:18:22,207 INFO L225 Difference]: With dead ends: 40 [2025-04-29 11:18:22,207 INFO L226 Difference]: Without dead ends: 40 [2025-04-29 11:18:22,207 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:18:22,210 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:18:22,210 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:18:22,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-04-29 11:18:22,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-04-29 11:18:22,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.40625) internal successors, (45), 39 states have internal predecessors, (45), 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-04-29 11:18:22,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2025-04-29 11:18:22,212 INFO L79 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 18 [2025-04-29 11:18:22,212 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:18:22,212 INFO L485 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2025-04-29 11:18:22,212 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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-04-29 11:18:22,212 INFO L278 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2025-04-29 11:18:22,214 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:18:22,214 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:18:22,214 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:18:22,214 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:18:22,215 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:18:22,215 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:18:22,215 INFO L85 PathProgramCache]: Analyzing trace with hash 2034777499, now seen corresponding path program 1 times [2025-04-29 11:18:22,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:18:22,215 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237274207] [2025-04-29 11:18:22,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:22,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:18:22,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:18:22,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:18:22,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:22,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:22,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:18:22,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:18:22,281 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237274207] [2025-04-29 11:18:22,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237274207] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:18:22,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:18:22,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:18:22,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724425397] [2025-04-29 11:18:22,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:18:22,281 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:18:22,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:18:22,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:18:22,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:18:22,283 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:18:22,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:18:22,318 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2025-04-29 11:18:22,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:18:22,318 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-29 11:18:22,318 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:18:22,318 INFO L225 Difference]: With dead ends: 40 [2025-04-29 11:18:22,318 INFO L226 Difference]: Without dead ends: 40 [2025-04-29 11:18:22,318 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:18:22,319 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:18:22,319 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 144 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:18:22,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-04-29 11:18:22,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-04-29 11:18:22,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.375) internal successors, (44), 39 states have internal predecessors, (44), 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-04-29 11:18:22,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2025-04-29 11:18:22,321 INFO L79 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 21 [2025-04-29 11:18:22,321 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:18:22,321 INFO L485 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2025-04-29 11:18:22,321 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:18:22,321 INFO L278 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2025-04-29 11:18:22,321 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:18:22,321 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:18:22,321 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:18:22,321 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:18:22,321 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:18:22,324 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:18:22,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2029018643, now seen corresponding path program 1 times [2025-04-29 11:18:22,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:18:22,324 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793261352] [2025-04-29 11:18:22,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:22,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:18:22,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:18:22,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:18:22,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:22,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:22,525 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:18:22,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:18:22,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793261352] [2025-04-29 11:18:22,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793261352] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:18:22,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694696103] [2025-04-29 11:18:22,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:22,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:18:22,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:18:22,528 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:18:22,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:18:22,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:18:22,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:18:22,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:22,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:22,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-29 11:18:22,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:18:22,597 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:18:22,627 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:18:22,627 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-29 11:18:22,673 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:18:22,779 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-04-29 11:18:22,795 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:18:22,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:18:23,021 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2025-04-29 11:18:23,027 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-04-29 11:18:23,136 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:18:23,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694696103] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:18:23,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:18:23,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2025-04-29 11:18:23,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118166088] [2025-04-29 11:18:23,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:18:23,137 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-29 11:18:23,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:18:23,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-29 11:18:23,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:18:23,138 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 21 states, 20 states have (on average 1.85) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:18:23,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:18:23,447 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2025-04-29 11:18:23,447 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:18:23,448 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-29 11:18:23,448 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:18:23,448 INFO L225 Difference]: With dead ends: 45 [2025-04-29 11:18:23,448 INFO L226 Difference]: Without dead ends: 45 [2025-04-29 11:18:23,448 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2025-04-29 11:18:23,449 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:18:23,449 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 282 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:18:23,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-04-29 11:18:23,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-04-29 11:18:23,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 35 states have (on average 1.4) internal successors, (49), 42 states have internal predecessors, (49), 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-04-29 11:18:23,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-04-29 11:18:23,451 INFO L79 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 21 [2025-04-29 11:18:23,451 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:18:23,451 INFO L485 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-04-29 11:18:23,451 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:18:23,451 INFO L278 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2025-04-29 11:18:23,452 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:18:23,452 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:18:23,452 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:18:23,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:18:23,655 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-29 11:18:23,655 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:18:23,655 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:18:23,656 INFO L85 PathProgramCache]: Analyzing trace with hash 2029018644, now seen corresponding path program 1 times [2025-04-29 11:18:23,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:18:23,656 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268932534] [2025-04-29 11:18:23,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:23,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:18:23,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:18:23,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:18:23,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:23,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:23,953 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:18:23,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:18:23,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268932534] [2025-04-29 11:18:23,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268932534] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:18:23,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498066047] [2025-04-29 11:18:23,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:23,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:18:23,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:18:23,955 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:18:23,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:18:23,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:18:24,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:18:24,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:24,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:24,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-29 11:18:24,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:18:24,020 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:18:24,025 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-29 11:18:24,063 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:18:24,063 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:18:24,068 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:18:24,102 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:18:24,105 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:18:24,225 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-04-29 11:18:24,229 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-29 11:18:24,238 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:18:24,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:18:24,538 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2025-04-29 11:18:24,541 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-04-29 11:18:24,545 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2025-04-29 11:18:24,549 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2025-04-29 11:18:24,566 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2025-04-29 11:18:24,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:18:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:18:24,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498066047] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:18:24,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:18:24,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 25 [2025-04-29 11:18:24,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562986636] [2025-04-29 11:18:24,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:18:24,764 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-29 11:18:24,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:18:24,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-29 11:18:24,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2025-04-29 11:18:24,765 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 26 states, 25 states have (on average 1.88) internal successors, (47), 26 states have internal predecessors, (47), 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-04-29 11:18:25,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:18:25,142 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2025-04-29 11:18:25,142 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:18:25,143 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.88) internal successors, (47), 26 states have internal predecessors, (47), 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 21 [2025-04-29 11:18:25,143 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:18:25,143 INFO L225 Difference]: With dead ends: 45 [2025-04-29 11:18:25,143 INFO L226 Difference]: Without dead ends: 45 [2025-04-29 11:18:25,143 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2025-04-29 11:18:25,144 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:18:25,144 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 417 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:18:25,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-04-29 11:18:25,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-04-29 11:18:25,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:18:25,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2025-04-29 11:18:25,145 INFO L79 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 21 [2025-04-29 11:18:25,145 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:18:25,145 INFO L485 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2025-04-29 11:18:25,146 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.88) internal successors, (47), 26 states have internal predecessors, (47), 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-04-29 11:18:25,146 INFO L278 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2025-04-29 11:18:25,146 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:18:25,146 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:18:25,146 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:18:25,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:18:25,346 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:18:25,346 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:18:25,347 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:18:25,347 INFO L85 PathProgramCache]: Analyzing trace with hash -869551702, now seen corresponding path program 1 times [2025-04-29 11:18:25,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:18:25,347 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347787923] [2025-04-29 11:18:25,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:25,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:18:25,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:18:25,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:18:25,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:25,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:25,409 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:18:25,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:18:25,410 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347787923] [2025-04-29 11:18:25,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347787923] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:18:25,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:18:25,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:18:25,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925756102] [2025-04-29 11:18:25,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:18:25,410 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:18:25,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:18:25,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:18:25,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:18:25,411 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:18:25,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:18:25,473 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2025-04-29 11:18:25,473 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:18:25,473 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-29 11:18:25,473 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:18:25,474 INFO L225 Difference]: With dead ends: 44 [2025-04-29 11:18:25,475 INFO L226 Difference]: Without dead ends: 44 [2025-04-29 11:18:25,475 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:18:25,475 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 9 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:18:25,476 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 89 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:18:25,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-04-29 11:18:25,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-04-29 11:18:25,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 43 states have internal predecessors, (51), 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-04-29 11:18:25,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2025-04-29 11:18:25,477 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 24 [2025-04-29 11:18:25,477 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:18:25,477 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2025-04-29 11:18:25,477 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:18:25,477 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2025-04-29 11:18:25,478 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:18:25,478 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:18:25,478 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:18:25,478 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:18:25,478 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:18:25,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:18:25,478 INFO L85 PathProgramCache]: Analyzing trace with hash -869551701, now seen corresponding path program 1 times [2025-04-29 11:18:25,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:18:25,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688204064] [2025-04-29 11:18:25,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:25,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:18:25,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:18:25,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:18:25,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:25,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:25,537 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 11:18:25,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:18:25,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688204064] [2025-04-29 11:18:25,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688204064] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:18:25,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438578130] [2025-04-29 11:18:25,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:25,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:18:25,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:18:25,540 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:18:25,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:18:25,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:18:25,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:18:25,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:25,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:25,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:18:25,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:18:25,644 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 11:18:25,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:18:25,687 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 11:18:25,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438578130] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:18:25,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:18:25,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-04-29 11:18:25,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347969122] [2025-04-29 11:18:25,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:18:25,688 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:18:25,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:18:25,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:18:25,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:18:25,688 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 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-04-29 11:18:25,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:18:25,714 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2025-04-29 11:18:25,714 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:18:25,714 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-29 11:18:25,715 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:18:25,715 INFO L225 Difference]: With dead ends: 46 [2025-04-29 11:18:25,715 INFO L226 Difference]: Without dead ends: 44 [2025-04-29 11:18:25,715 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:18:25,715 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:18:25,715 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 156 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:18:25,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-04-29 11:18:25,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-04-29 11:18:25,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 43 states have internal predecessors, (50), 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-04-29 11:18:25,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2025-04-29 11:18:25,717 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 24 [2025-04-29 11:18:25,717 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:18:25,717 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2025-04-29 11:18:25,717 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 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-04-29 11:18:25,717 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2025-04-29 11:18:25,718 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:18:25,718 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:18:25,718 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:18:25,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 11:18:25,919 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:18:25,920 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:18:25,921 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:18:25,921 INFO L85 PathProgramCache]: Analyzing trace with hash -875310558, now seen corresponding path program 2 times [2025-04-29 11:18:25,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:18:25,921 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553869071] [2025-04-29 11:18:25,921 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:18:25,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:18:25,927 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-29 11:18:25,939 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:18:25,939 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:18:25,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:26,231 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:18:26,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:18:26,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553869071] [2025-04-29 11:18:26,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553869071] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:18:26,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218721889] [2025-04-29 11:18:26,231 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:18:26,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:18:26,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:18:26,233 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:18:26,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:18:26,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-29 11:18:26,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:18:26,285 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:18:26,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:26,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-04-29 11:18:26,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:18:26,296 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:18:26,323 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:18:26,326 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:18:26,380 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:18:26,381 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:18:26,420 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-29 11:18:26,427 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-29 11:18:26,674 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:18:26,680 INFO L325 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2025-04-29 11:18:26,680 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 31 [2025-04-29 11:18:26,687 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:18:26,687 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 16 [2025-04-29 11:18:26,692 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:18:26,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:18:27,710 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 118 [2025-04-29 11:18:27,782 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2025-04-29 11:18:27,951 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:18:27,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218721889] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:18:27,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:18:27,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 34 [2025-04-29 11:18:27,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951129102] [2025-04-29 11:18:27,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:18:27,952 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-29 11:18:27,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:18:27,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-29 11:18:27,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1044, Unknown=0, NotChecked=0, Total=1122 [2025-04-29 11:18:27,953 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 34 states, 34 states have (on average 1.588235294117647) internal successors, (54), 34 states have internal predecessors, (54), 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-04-29 11:18:28,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:18:28,567 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2025-04-29 11:18:28,567 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:18:28,567 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.588235294117647) internal successors, (54), 34 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-29 11:18:28,568 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:18:28,568 INFO L225 Difference]: With dead ends: 58 [2025-04-29 11:18:28,568 INFO L226 Difference]: Without dead ends: 58 [2025-04-29 11:18:28,568 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=122, Invalid=1600, Unknown=0, NotChecked=0, Total=1722 [2025-04-29 11:18:28,569 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:18:28,569 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 703 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:18:28,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-04-29 11:18:28,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-04-29 11:18:28,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 55 states have internal predecessors, (63), 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-04-29 11:18:28,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2025-04-29 11:18:28,574 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 24 [2025-04-29 11:18:28,574 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:18:28,574 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2025-04-29 11:18:28,574 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.588235294117647) internal successors, (54), 34 states have internal predecessors, (54), 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-04-29 11:18:28,574 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2025-04-29 11:18:28,574 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 11:18:28,574 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:18:28,575 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:18:28,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 11:18:28,775 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-29 11:18:28,775 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:18:28,776 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:18:28,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1624600772, now seen corresponding path program 2 times [2025-04-29 11:18:28,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:18:28,776 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063887574] [2025-04-29 11:18:28,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:18:28,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:18:28,782 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-29 11:18:28,790 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:18:28,790 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:18:28,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:28,903 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:18:28,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:18:28,903 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063887574] [2025-04-29 11:18:28,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063887574] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:18:28,903 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850122783] [2025-04-29 11:18:28,903 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:18:28,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:18:28,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:18:28,905 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:18:28,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 11:18:28,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-29 11:18:28,960 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:18:28,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:18:28,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:28,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-29 11:18:28,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:18:28,997 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:18:28,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:18:29,026 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:18:29,026 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2025-04-29 11:18:29,072 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:18:29,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850122783] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:18:29,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:18:29,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 9 [2025-04-29 11:18:29,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481043392] [2025-04-29 11:18:29,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:18:29,073 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:18:29,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:18:29,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:18:29,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:18:29,074 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:18:29,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:18:29,146 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2025-04-29 11:18:29,146 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:18:29,147 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-29 11:18:29,147 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:18:29,147 INFO L225 Difference]: With dead ends: 56 [2025-04-29 11:18:29,147 INFO L226 Difference]: Without dead ends: 56 [2025-04-29 11:18:29,147 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:18:29,148 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:18:29,148 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 168 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:18:29,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-29 11:18:29,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-04-29 11:18:29,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 55 states have internal predecessors, (62), 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-04-29 11:18:29,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2025-04-29 11:18:29,150 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 27 [2025-04-29 11:18:29,150 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:18:29,150 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2025-04-29 11:18:29,150 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:18:29,150 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2025-04-29 11:18:29,150 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:18:29,150 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:18:29,150 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:18:29,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-29 11:18:29,354 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-29 11:18:29,354 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:18:29,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:18:29,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1176995576, now seen corresponding path program 1 times [2025-04-29 11:18:29,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:18:29,354 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416413687] [2025-04-29 11:18:29,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:29,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:18:29,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:18:29,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:18:29,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:29,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:29,422 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:18:29,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:18:29,422 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416413687] [2025-04-29 11:18:29,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416413687] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:18:29,422 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625557052] [2025-04-29 11:18:29,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:29,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:18:29,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:18:29,424 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:18:29,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 11:18:29,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:18:29,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:18:29,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:29,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:29,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-29 11:18:29,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:18:29,528 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:18:29,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:18:29,592 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:18:29,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625557052] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-29 11:18:29,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:18:29,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8, 9] total 15 [2025-04-29 11:18:29,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493201937] [2025-04-29 11:18:29,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:18:29,593 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:18:29,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:18:29,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:18:29,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:18:29,594 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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-04-29 11:18:29,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:18:29,639 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2025-04-29 11:18:29,639 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:18:29,639 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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 28 [2025-04-29 11:18:29,639 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:18:29,640 INFO L225 Difference]: With dead ends: 61 [2025-04-29 11:18:29,640 INFO L226 Difference]: Without dead ends: 61 [2025-04-29 11:18:29,640 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:18:29,640 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:18:29,640 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 133 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:18:29,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-04-29 11:18:29,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2025-04-29 11:18:29,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 55 states have internal predecessors, (61), 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-04-29 11:18:29,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2025-04-29 11:18:29,642 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 28 [2025-04-29 11:18:29,642 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:18:29,642 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2025-04-29 11:18:29,642 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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-04-29 11:18:29,642 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2025-04-29 11:18:29,642 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:18:29,642 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:18:29,642 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:18:29,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-29 11:18:29,850 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:18:29,850 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:18:29,850 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:18:29,850 INFO L85 PathProgramCache]: Analyzing trace with hash -197631445, now seen corresponding path program 3 times [2025-04-29 11:18:29,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:18:29,850 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408891407] [2025-04-29 11:18:29,850 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:18:29,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:18:29,856 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-29 11:18:29,866 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:18:29,866 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-29 11:18:29,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:29,898 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:18:29,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:18:29,898 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408891407] [2025-04-29 11:18:29,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408891407] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:18:29,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:18:29,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:18:29,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842911028] [2025-04-29 11:18:29,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:18:29,899 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:18:29,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:18:29,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:18:29,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:18:29,899 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-04-29 11:18:29,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:18:29,926 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2025-04-29 11:18:29,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:18:29,926 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 28 [2025-04-29 11:18:29,927 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:18:29,927 INFO L225 Difference]: With dead ends: 80 [2025-04-29 11:18:29,927 INFO L226 Difference]: Without dead ends: 80 [2025-04-29 11:18:29,927 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:18:29,927 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 14 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:18:29,927 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 94 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:18:29,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-04-29 11:18:29,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2025-04-29 11:18:29,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 68 states have internal predecessors, (76), 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-04-29 11:18:29,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2025-04-29 11:18:29,929 INFO L79 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 28 [2025-04-29 11:18:29,929 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:18:29,929 INFO L485 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2025-04-29 11:18:29,929 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-04-29 11:18:29,929 INFO L278 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2025-04-29 11:18:29,933 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:18:29,933 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:18:29,933 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:18:29,933 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:18:29,933 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:18:29,933 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:18:29,934 INFO L85 PathProgramCache]: Analyzing trace with hash 2126754075, now seen corresponding path program 1 times [2025-04-29 11:18:29,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:18:29,934 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152729278] [2025-04-29 11:18:29,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:29,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:18:29,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:18:29,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:18:29,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:29,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:29,982 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 11:18:29,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:18:29,983 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152729278] [2025-04-29 11:18:29,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152729278] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:18:29,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:18:29,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:18:29,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783466360] [2025-04-29 11:18:29,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:18:29,983 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:18:29,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:18:29,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:18:29,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:18:29,984 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:18:30,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:18:30,020 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2025-04-29 11:18:30,021 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:18:30,021 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-29 11:18:30,021 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:18:30,021 INFO L225 Difference]: With dead ends: 71 [2025-04-29 11:18:30,021 INFO L226 Difference]: Without dead ends: 71 [2025-04-29 11:18:30,022 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:18:30,022 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:18:30,022 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 144 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:18:30,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-04-29 11:18:30,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-04-29 11:18:30,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.21875) internal successors, (78), 70 states have internal predecessors, (78), 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-04-29 11:18:30,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2025-04-29 11:18:30,024 INFO L79 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 29 [2025-04-29 11:18:30,024 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:18:30,028 INFO L485 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2025-04-29 11:18:30,028 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:18:30,028 INFO L278 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2025-04-29 11:18:30,028 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:18:30,028 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:18:30,028 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:18:30,028 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:18:30,028 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:18:30,029 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:18:30,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1504866986, now seen corresponding path program 1 times [2025-04-29 11:18:30,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:18:30,029 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764690419] [2025-04-29 11:18:30,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:30,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:18:30,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:18:30,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:18:30,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:30,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:30,088 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 11:18:30,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:18:30,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764690419] [2025-04-29 11:18:30,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764690419] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:18:30,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:18:30,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:18:30,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799804275] [2025-04-29 11:18:30,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:18:30,089 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:18:30,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:18:30,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:18:30,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:18:30,089 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 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-04-29 11:18:30,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:18:30,136 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2025-04-29 11:18:30,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:18:30,136 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 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 30 [2025-04-29 11:18:30,136 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:18:30,136 INFO L225 Difference]: With dead ends: 72 [2025-04-29 11:18:30,136 INFO L226 Difference]: Without dead ends: 72 [2025-04-29 11:18:30,137 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:18:30,137 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 5 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:18:30,137 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 126 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:18:30,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-04-29 11:18:30,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-04-29 11:18:30,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 71 states have internal predecessors, (79), 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-04-29 11:18:30,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2025-04-29 11:18:30,139 INFO L79 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 30 [2025-04-29 11:18:30,139 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:18:30,139 INFO L485 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2025-04-29 11:18:30,139 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 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-04-29 11:18:30,139 INFO L278 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2025-04-29 11:18:30,139 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-29 11:18:30,139 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:18:30,139 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:18:30,139 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:18:30,139 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:18:30,140 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:18:30,140 INFO L85 PathProgramCache]: Analyzing trace with hash -720477230, now seen corresponding path program 1 times [2025-04-29 11:18:30,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:18:30,140 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078375698] [2025-04-29 11:18:30,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:30,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:18:30,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:18:30,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:18:30,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:30,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:30,414 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:18:30,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:18:30,414 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078375698] [2025-04-29 11:18:30,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078375698] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:18:30,414 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245076601] [2025-04-29 11:18:30,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:30,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:18:30,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:18:30,417 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:18:30,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-29 11:18:30,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:18:30,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:18:30,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:30,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:30,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-29 11:18:30,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:18:30,477 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:18:30,492 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 11:18:30,492 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 11:18:30,521 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:18:30,585 INFO L325 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2025-04-29 11:18:30,585 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2025-04-29 11:18:30,633 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 29 [2025-04-29 11:18:30,643 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:18:30,779 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 11:18:30,893 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:18:30,893 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 29 [2025-04-29 11:18:30,981 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:18:30,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:18:31,241 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-04-29 11:18:31,244 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-04-29 11:18:31,486 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 158 [2025-04-29 11:18:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:18:31,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245076601] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:18:31,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:18:31,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 38 [2025-04-29 11:18:31,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211231929] [2025-04-29 11:18:31,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:18:31,993 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-29 11:18:31,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:18:31,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-29 11:18:31,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1367, Unknown=0, NotChecked=0, Total=1482 [2025-04-29 11:18:31,994 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 39 states, 38 states have (on average 1.763157894736842) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:18:32,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:18:32,734 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2025-04-29 11:18:32,734 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:18:32,734 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.763157894736842) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-29 11:18:32,734 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:18:32,734 INFO L225 Difference]: With dead ends: 77 [2025-04-29 11:18:32,735 INFO L226 Difference]: Without dead ends: 77 [2025-04-29 11:18:32,735 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=203, Invalid=2053, Unknown=0, NotChecked=0, Total=2256 [2025-04-29 11:18:32,736 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:18:32,736 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 475 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:18:32,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-04-29 11:18:32,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2025-04-29 11:18:32,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 74 states have internal predecessors, (84), 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-04-29 11:18:32,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2025-04-29 11:18:32,737 INFO L79 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 32 [2025-04-29 11:18:32,738 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:18:32,738 INFO L485 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2025-04-29 11:18:32,738 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.763157894736842) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:18:32,738 INFO L278 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2025-04-29 11:18:32,738 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-29 11:18:32,738 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:18:32,738 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:18:32,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-29 11:18:32,942 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:18:32,942 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:18:32,942 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:18:32,942 INFO L85 PathProgramCache]: Analyzing trace with hash -720477229, now seen corresponding path program 1 times [2025-04-29 11:18:32,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:18:32,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700804924] [2025-04-29 11:18:32,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:32,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:18:32,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:18:32,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:18:32,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:32,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:33,401 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:18:33,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:18:33,401 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700804924] [2025-04-29 11:18:33,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700804924] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:18:33,402 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625580611] [2025-04-29 11:18:33,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:33,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:18:33,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:18:33,404 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:18:33,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-29 11:18:33,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:18:33,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:18:33,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:33,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:33,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-04-29 11:18:33,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:18:33,476 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-29 11:18:33,480 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:18:33,504 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 11:18:33,505 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 11:18:33,511 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:18:33,546 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:18:33,549 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:18:33,624 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-29 11:18:33,625 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2025-04-29 11:18:33,642 INFO L325 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-04-29 11:18:33,643 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-04-29 11:18:33,690 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 29 [2025-04-29 11:18:33,698 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-29 11:18:33,972 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:18:33,979 INFO L325 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2025-04-29 11:18:33,979 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 41 [2025-04-29 11:18:33,989 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:18:33,989 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 16 [2025-04-29 11:18:33,995 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:18:33,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:18:34,999 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_352 Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_42| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| Int) (v_ArrVal_349 Int)) (or (< v_ArrVal_352 |v_ULTIMATE.start_sll_length_~head#1.offset_42|) (< |v_ULTIMATE.start_sll_length_~head#1.offset_42| 0) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) 0)) (< (+ 3 (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) 0 v_ArrVal_352)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_42|)) (select (store |c_#length| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| v_ArrVal_349) (select (select (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_42|))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_ArrVal_352))) (forall ((v_ArrVal_352 Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_42| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| Int)) (or (< v_ArrVal_352 |v_ULTIMATE.start_sll_length_~head#1.offset_42|) (< |v_ULTIMATE.start_sll_length_~head#1.offset_42| 0) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) 0)) (< 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49| (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_49|) 0 v_ArrVal_352)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_42|) 1)) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_ArrVal_352)))) is different from false [2025-04-29 11:18:35,011 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2025-04-29 11:18:35,056 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 406 treesize of output 398 [2025-04-29 11:18:35,068 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:18:35,068 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 443 treesize of output 435 [2025-04-29 11:18:35,723 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2025-04-29 11:18:35,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625580611] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:18:35,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:18:35,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 40 [2025-04-29 11:18:35,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384790421] [2025-04-29 11:18:35,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:18:35,723 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-29 11:18:35,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:18:35,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-29 11:18:35,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1464, Unknown=1, NotChecked=76, Total=1640 [2025-04-29 11:18:35,725 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 41 states, 40 states have (on average 1.75) internal successors, (70), 41 states have internal predecessors, (70), 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-04-29 11:18:36,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:18:36,801 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2025-04-29 11:18:36,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:18:36,801 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.75) internal successors, (70), 41 states have internal predecessors, (70), 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 32 [2025-04-29 11:18:36,801 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:18:36,801 INFO L225 Difference]: With dead ends: 77 [2025-04-29 11:18:36,801 INFO L226 Difference]: Without dead ends: 77 [2025-04-29 11:18:36,802 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=208, Invalid=2345, Unknown=1, NotChecked=98, Total=2652 [2025-04-29 11:18:36,802 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-29 11:18:36,802 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 718 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 987 Invalid, 0 Unknown, 36 Unchecked, 0.6s Time] [2025-04-29 11:18:36,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-04-29 11:18:36,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2025-04-29 11:18:36,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 74 states have internal predecessors, (83), 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-04-29 11:18:36,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2025-04-29 11:18:36,804 INFO L79 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 32 [2025-04-29 11:18:36,804 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:18:36,804 INFO L485 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2025-04-29 11:18:36,804 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.75) internal successors, (70), 41 states have internal predecessors, (70), 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-04-29 11:18:36,804 INFO L278 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2025-04-29 11:18:36,804 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-29 11:18:36,804 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:18:36,805 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:18:36,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-29 11:18:37,009 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:18:37,009 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:18:37,009 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:18:37,009 INFO L85 PathProgramCache]: Analyzing trace with hash 623846240, now seen corresponding path program 1 times [2025-04-29 11:18:37,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:18:37,010 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481134919] [2025-04-29 11:18:37,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:37,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:18:37,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:18:37,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:18:37,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:37,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:37,232 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:18:37,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:18:37,232 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481134919] [2025-04-29 11:18:37,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481134919] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:18:37,233 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643364017] [2025-04-29 11:18:37,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:37,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:18:37,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:18:37,235 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:18:37,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-29 11:18:37,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:18:37,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:18:37,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:37,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:37,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-29 11:18:37,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:18:37,307 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:18:37,316 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:18:37,316 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:18:37,338 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:18:37,504 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:18:37,504 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2025-04-29 11:18:37,576 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:18:37,579 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:18:37,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:18:37,653 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:18:37,653 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2025-04-29 11:18:37,752 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-04-29 11:18:37,754 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-04-29 11:18:37,799 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:18:37,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643364017] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:18:37,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:18:37,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 34 [2025-04-29 11:18:37,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670340275] [2025-04-29 11:18:37,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:18:37,800 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-29 11:18:37,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:18:37,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-29 11:18:37,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2025-04-29 11:18:37,801 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 35 states have internal predecessors, (69), 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-04-29 11:18:38,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:18:38,264 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2025-04-29 11:18:38,266 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-29 11:18:38,266 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 35 states have internal predecessors, (69), 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 33 [2025-04-29 11:18:38,266 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:18:38,267 INFO L225 Difference]: With dead ends: 78 [2025-04-29 11:18:38,267 INFO L226 Difference]: Without dead ends: 78 [2025-04-29 11:18:38,267 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=165, Invalid=1997, Unknown=0, NotChecked=0, Total=2162 [2025-04-29 11:18:38,268 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 26 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:18:38,268 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 341 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:18:38,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-04-29 11:18:38,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-04-29 11:18:38,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 77 states have internal predecessors, (88), 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-04-29 11:18:38,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2025-04-29 11:18:38,271 INFO L79 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 33 [2025-04-29 11:18:38,271 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:18:38,271 INFO L485 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2025-04-29 11:18:38,271 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 35 states have internal predecessors, (69), 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-04-29 11:18:38,271 INFO L278 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2025-04-29 11:18:38,271 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-29 11:18:38,271 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:18:38,271 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:18:38,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-29 11:18:38,475 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-04-29 11:18:38,475 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:18:38,475 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:18:38,475 INFO L85 PathProgramCache]: Analyzing trace with hash 623846241, now seen corresponding path program 1 times [2025-04-29 11:18:38,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:18:38,475 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960095300] [2025-04-29 11:18:38,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:38,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:18:38,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:18:38,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:18:38,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:38,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:38,617 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 11:18:38,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:18:38,617 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960095300] [2025-04-29 11:18:38,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960095300] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:18:38,617 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195100133] [2025-04-29 11:18:38,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:38,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:18:38,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:18:38,619 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:18:38,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-29 11:18:38,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:18:38,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:18:38,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:38,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:38,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-04-29 11:18:38,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:18:38,705 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:18:38,706 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:18:38,831 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:18:38,831 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-04-29 11:18:38,837 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:18:38,837 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-04-29 11:18:38,927 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:18:38,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:18:39,029 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:18:39,030 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2025-04-29 11:18:39,195 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-04-29 11:18:39,195 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-04-29 11:18:39,254 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:18:39,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195100133] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:18:39,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:18:39,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 16] total 37 [2025-04-29 11:18:39,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647561315] [2025-04-29 11:18:39,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:18:39,255 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-29 11:18:39,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:18:39,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-29 11:18:39,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1304, Unknown=0, NotChecked=0, Total=1406 [2025-04-29 11:18:39,256 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 38 states have internal predecessors, (79), 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-04-29 11:18:39,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:18:39,672 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2025-04-29 11:18:39,673 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-29 11:18:39,673 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 38 states have internal predecessors, (79), 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 33 [2025-04-29 11:18:39,673 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:18:39,673 INFO L225 Difference]: With dead ends: 80 [2025-04-29 11:18:39,673 INFO L226 Difference]: Without dead ends: 80 [2025-04-29 11:18:39,674 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=1998, Unknown=0, NotChecked=0, Total=2162 [2025-04-29 11:18:39,674 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:18:39,674 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 457 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:18:39,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-04-29 11:18:39,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-04-29 11:18:39,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 79 states have internal predecessors, (89), 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-04-29 11:18:39,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2025-04-29 11:18:39,675 INFO L79 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 33 [2025-04-29 11:18:39,675 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:18:39,676 INFO L485 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2025-04-29 11:18:39,676 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 38 states have internal predecessors, (79), 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-04-29 11:18:39,676 INFO L278 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2025-04-29 11:18:39,676 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 11:18:39,676 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:18:39,676 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:18:39,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-29 11:18:39,882 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-29 11:18:39,882 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:18:39,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:18:39,882 INFO L85 PathProgramCache]: Analyzing trace with hash -2135591053, now seen corresponding path program 1 times [2025-04-29 11:18:39,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:18:39,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060042817] [2025-04-29 11:18:39,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:39,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:18:39,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:18:39,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:18:39,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:39,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:40,057 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:18:40,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:18:40,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060042817] [2025-04-29 11:18:40,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060042817] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:18:40,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950490996] [2025-04-29 11:18:40,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:40,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:18:40,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:18:40,060 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:18:40,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-29 11:18:40,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:18:40,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:18:40,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:40,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:40,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-29 11:18:40,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:18:40,170 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:18:40,257 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:18:40,258 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2025-04-29 11:18:40,315 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:18:40,315 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:18:40,374 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-04-29 11:18:40,375 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-04-29 11:18:40,383 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:18:40,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950490996] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:18:40,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:18:40,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 27 [2025-04-29 11:18:40,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226681752] [2025-04-29 11:18:40,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:18:40,383 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-29 11:18:40,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:18:40,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-29 11:18:40,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2025-04-29 11:18:40,384 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 27 states have internal predecessors, (57), 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-04-29 11:18:40,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:18:40,784 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2025-04-29 11:18:40,785 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:18:40,785 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 27 states have internal predecessors, (57), 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 34 [2025-04-29 11:18:40,785 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:18:40,785 INFO L225 Difference]: With dead ends: 82 [2025-04-29 11:18:40,785 INFO L226 Difference]: Without dead ends: 82 [2025-04-29 11:18:40,786 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=162, Invalid=1730, Unknown=0, NotChecked=0, Total=1892 [2025-04-29 11:18:40,786 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 21 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:18:40,786 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 479 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:18:40,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-04-29 11:18:40,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2025-04-29 11:18:40,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 79 states have internal predecessors, (88), 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-04-29 11:18:40,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2025-04-29 11:18:40,788 INFO L79 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 34 [2025-04-29 11:18:40,788 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:18:40,788 INFO L485 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2025-04-29 11:18:40,788 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 27 states have internal predecessors, (57), 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-04-29 11:18:40,788 INFO L278 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2025-04-29 11:18:40,789 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 11:18:40,789 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:18:40,789 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:18:40,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-29 11:18:40,989 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-29 11:18:40,990 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:18:40,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:18:40,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1785561085, now seen corresponding path program 2 times [2025-04-29 11:18:40,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:18:40,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051444097] [2025-04-29 11:18:40,990 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:18:40,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:18:40,994 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-29 11:18:40,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:18:40,998 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:18:40,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:41,594 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:18:41,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:18:41,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051444097] [2025-04-29 11:18:41,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051444097] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:18:41,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649051781] [2025-04-29 11:18:41,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:18:41,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:18:41,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:18:41,596 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:18:41,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-29 11:18:41,644 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-29 11:18:41,662 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:18:41,662 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:18:41,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:41,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-04-29 11:18:41,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:18:41,669 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:18:41,696 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:18:41,699 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:18:41,739 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 11:18:41,740 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 11:18:41,784 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-29 11:18:41,789 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-29 11:18:41,878 INFO L325 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-04-29 11:18:41,878 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-04-29 11:18:41,935 INFO L325 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2025-04-29 11:18:41,935 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 44 [2025-04-29 11:18:41,941 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2025-04-29 11:18:42,505 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:18:42,523 INFO L325 Elim1Store]: treesize reduction 81, result has 12.0 percent of original size [2025-04-29 11:18:42,524 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 111 treesize of output 62 [2025-04-29 11:18:42,537 INFO L325 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2025-04-29 11:18:42,537 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 25 [2025-04-29 11:18:42,592 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:18:42,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:18:47,946 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_71| Int)) (or (forall ((v_ArrVal_484 Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_64| Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_63| Int)) (or (= (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_64|))) |v_ULTIMATE.start_sll_length_~head#1.offset_63|) 0) (< (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71| (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71|) 0 v_ArrVal_484)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_64|) |v_ULTIMATE.start_sll_length_~head#1.offset_63|) (< |v_ULTIMATE.start_sll_length_~head#1.offset_64| 0) (< v_ArrVal_484 |v_ULTIMATE.start_sll_length_~head#1.offset_64|) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_484) (< |v_ULTIMATE.start_sll_length_~head#1.offset_63| 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71|) 0)))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_71| Int)) (or (forall ((v_ArrVal_484 Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_64| Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_63| Int)) (let ((.cse1 (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71| (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71|) 0 v_ArrVal_484)))) (or (< (select (select .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_64|) |v_ULTIMATE.start_sll_length_~head#1.offset_63|) (< |v_ULTIMATE.start_sll_length_~head#1.offset_64| 0) (= (select (select .cse1 (select (select (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_64|)) |v_ULTIMATE.start_sll_length_~head#1.offset_63|) 0) (< v_ArrVal_484 |v_ULTIMATE.start_sll_length_~head#1.offset_64|) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_484) (< |v_ULTIMATE.start_sll_length_~head#1.offset_63| 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71|) 0))))) is different from false [2025-04-29 11:18:47,998 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_71| Int) (v_ArrVal_484 Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_64| Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_63| Int)) (or (< |v_ULTIMATE.start_sll_length_~head#1.offset_64| 0) (< v_ArrVal_484 |v_ULTIMATE.start_sll_length_~head#1.offset_64|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71|) 0)) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_ArrVal_484) (< (select (select (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71| (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71|) 0 v_ArrVal_484)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_64|) |v_ULTIMATE.start_sll_length_~head#1.offset_63|) (= (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_64|))) |v_ULTIMATE.start_sll_length_~head#1.offset_63|) 0) (< |v_ULTIMATE.start_sll_length_~head#1.offset_63| 0))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_71| Int) (v_ArrVal_484 Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_64| Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_63| Int)) (let ((.cse1 (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71| (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71|) 0 v_ArrVal_484)))) (or (< |v_ULTIMATE.start_sll_length_~head#1.offset_64| 0) (< v_ArrVal_484 |v_ULTIMATE.start_sll_length_~head#1.offset_64|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71|) 0)) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_ArrVal_484) (< (select (select .cse1 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_64|) |v_ULTIMATE.start_sll_length_~head#1.offset_63|) (= (select (select .cse1 (select (select (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_64|)) |v_ULTIMATE.start_sll_length_~head#1.offset_63|) 0) (< |v_ULTIMATE.start_sll_length_~head#1.offset_63| 0))))) is different from false [2025-04-29 11:18:48,401 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_72| Int)) (or (forall ((v_ArrVal_481 Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_71| Int) (v_ArrVal_484 Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_64| Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_63| Int)) (or (< |v_ULTIMATE.start_sll_length_~head#1.offset_64| 0) (= (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71|) 0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72|))))) (select .cse0 (select (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72|) |v_ULTIMATE.start_sll_length_~head#1.offset_64|))) |v_ULTIMATE.start_sll_length_~head#1.offset_63|) 0) (< 0 v_ArrVal_484) (< (select (select (let ((.cse2 (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72| (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72|) 0 v_ArrVal_481)))) (store .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71| (store (select .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71|) 0 v_ArrVal_484))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72|) |v_ULTIMATE.start_sll_length_~head#1.offset_64|) |v_ULTIMATE.start_sll_length_~head#1.offset_63|) (< v_ArrVal_484 |v_ULTIMATE.start_sll_length_~head#1.offset_64|) (not (= (select (store |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72| 1) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71|) 0)) (< |v_ULTIMATE.start_sll_length_~head#1.offset_63| 0))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_481))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72|) 0)))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_72| Int)) (or (forall ((v_ArrVal_481 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_481) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_71| Int) (v_ArrVal_484 Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_64| Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_63| Int)) (let ((.cse3 (let ((.cse5 (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72| (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72|) 0 v_ArrVal_481)))) (store .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71| (store (select .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71|) 0 v_ArrVal_484))))) (or (< |v_ULTIMATE.start_sll_length_~head#1.offset_64| 0) (< 0 v_ArrVal_484) (< (select (select .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72|) |v_ULTIMATE.start_sll_length_~head#1.offset_64|) |v_ULTIMATE.start_sll_length_~head#1.offset_63|) (< v_ArrVal_484 |v_ULTIMATE.start_sll_length_~head#1.offset_64|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71|) 0)) (= (select (select .cse3 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71| (store (select .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71|) 0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72|))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72|) |v_ULTIMATE.start_sll_length_~head#1.offset_64|)) |v_ULTIMATE.start_sll_length_~head#1.offset_63|) 0) (< |v_ULTIMATE.start_sll_length_~head#1.offset_63| 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72|) 0))))) is different from false [2025-04-29 11:18:48,484 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_71| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_72| Int) (v_ArrVal_484 Int) (v_ArrVal_481 Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_64| Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_63| Int)) (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72| (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72|) 0 v_ArrVal_481)))) (store .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71| (store (select .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71|) 0 v_ArrVal_484))))) (or (< |v_ULTIMATE.start_sll_length_~head#1.offset_64| 0) (= (select (select .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71|) 0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72|))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72|) |v_ULTIMATE.start_sll_length_~head#1.offset_64|)) |v_ULTIMATE.start_sll_length_~head#1.offset_63|) 0) (< 0 v_ArrVal_484) (< (select (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72|) |v_ULTIMATE.start_sll_length_~head#1.offset_64|) |v_ULTIMATE.start_sll_length_~head#1.offset_63|) (< v_ArrVal_484 |v_ULTIMATE.start_sll_length_~head#1.offset_64|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71|) 0)) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_ArrVal_481) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72|) 0)) (< |v_ULTIMATE.start_sll_length_~head#1.offset_63| 0)))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_71| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_72| Int) (v_ArrVal_484 Int) (v_ArrVal_481 Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_64| Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_63| Int)) (or (< |v_ULTIMATE.start_sll_length_~head#1.offset_64| 0) (< 0 v_ArrVal_484) (< (select (select (let ((.cse3 (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72| (store (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72|) 0 v_ArrVal_481)))) (store .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71| (store (select .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71|) 0 v_ArrVal_484))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72|) |v_ULTIMATE.start_sll_length_~head#1.offset_64|) |v_ULTIMATE.start_sll_length_~head#1.offset_63|) (= (select (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)))) (store .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71| (store (select .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71|) 0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72|))))) (select .cse4 (select (select .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72|) |v_ULTIMATE.start_sll_length_~head#1.offset_64|))) |v_ULTIMATE.start_sll_length_~head#1.offset_63|) 0) (< v_ArrVal_484 |v_ULTIMATE.start_sll_length_~head#1.offset_64|) (not (= (select (store |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72| 1) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_71|) 0)) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_ArrVal_481) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_72|) 0)) (< |v_ULTIMATE.start_sll_length_~head#1.offset_63| 0)))) is different from false [2025-04-29 11:18:48,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:18:48,507 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:18:48,511 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:18:48,512 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 142 [2025-04-29 11:18:48,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:18:48,708 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18949 treesize of output 17925 [2025-04-29 11:18:48,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:18:49,250 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 8 not checked. [2025-04-29 11:18:49,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649051781] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:18:49,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:18:49,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 52 [2025-04-29 11:18:49,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436344812] [2025-04-29 11:18:49,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:18:49,251 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-04-29 11:18:49,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:18:49,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-04-29 11:18:49,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=2147, Unknown=5, NotChecked=380, Total=2652 [2025-04-29 11:18:49,252 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 52 states have internal predecessors, (80), 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-04-29 11:18:50,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:18:50,849 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2025-04-29 11:18:50,849 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 11:18:50,849 INFO L79 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 52 states have internal predecessors, (80), 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 35 [2025-04-29 11:18:50,849 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:18:50,850 INFO L225 Difference]: With dead ends: 97 [2025-04-29 11:18:50,850 INFO L226 Difference]: Without dead ends: 97 [2025-04-29 11:18:50,851 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=183, Invalid=3368, Unknown=5, NotChecked=476, Total=4032 [2025-04-29 11:18:50,851 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 9 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-29 11:18:50,852 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1035 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1270 Invalid, 0 Unknown, 168 Unchecked, 0.8s Time] [2025-04-29 11:18:50,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-04-29 11:18:50,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2025-04-29 11:18:50,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 85 states have (on average 1.2) internal successors, (102), 91 states have internal predecessors, (102), 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-04-29 11:18:50,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2025-04-29 11:18:50,854 INFO L79 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 35 [2025-04-29 11:18:50,854 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:18:50,854 INFO L485 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2025-04-29 11:18:50,854 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 52 states have internal predecessors, (80), 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-04-29 11:18:50,854 INFO L278 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2025-04-29 11:18:50,854 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-29 11:18:50,854 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:18:50,854 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:18:50,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-29 11:18:51,055 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-29 11:18:51,055 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:18:51,055 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:18:51,055 INFO L85 PathProgramCache]: Analyzing trace with hash 679882853, now seen corresponding path program 1 times [2025-04-29 11:18:51,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:18:51,055 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761349344] [2025-04-29 11:18:51,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:51,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:18:51,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:18:51,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:18:51,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:51,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:51,176 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:18:51,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:18:51,176 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761349344] [2025-04-29 11:18:51,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761349344] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:18:51,176 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544540671] [2025-04-29 11:18:51,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:18:51,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:18:51,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:18:51,178 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:18:51,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-29 11:18:51,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:18:51,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:18:51,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:18:51,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:51,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-29 11:18:51,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:18:51,274 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:18:51,357 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:18:51,357 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-04-29 11:18:51,414 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:18:51,415 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:18:51,531 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-04-29 11:18:51,532 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-04-29 11:18:51,552 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:18:51,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544540671] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:18:51,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:18:51,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 21 [2025-04-29 11:18:51,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517469496] [2025-04-29 11:18:51,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:18:51,552 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-29 11:18:51,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:18:51,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-29 11:18:51,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2025-04-29 11:18:51,553 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 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-04-29 11:18:51,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:18:51,807 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2025-04-29 11:18:51,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 11:18:51,807 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 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 36 [2025-04-29 11:18:51,807 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:18:51,808 INFO L225 Difference]: With dead ends: 93 [2025-04-29 11:18:51,808 INFO L226 Difference]: Without dead ends: 93 [2025-04-29 11:18:51,808 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 51 SyntacticMatches, 10 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2025-04-29 11:18:51,808 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:18:51,808 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 321 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:18:51,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-04-29 11:18:51,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-04-29 11:18:51,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 86 states have (on average 1.197674418604651) internal successors, (103), 92 states have internal predecessors, (103), 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-04-29 11:18:51,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2025-04-29 11:18:51,810 INFO L79 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 36 [2025-04-29 11:18:51,810 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:18:51,810 INFO L485 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2025-04-29 11:18:51,810 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 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-04-29 11:18:51,810 INFO L278 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2025-04-29 11:18:51,810 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-29 11:18:51,810 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:18:51,810 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:18:51,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-29 11:18:52,013 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:18:52,013 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:18:52,013 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:18:52,013 INFO L85 PathProgramCache]: Analyzing trace with hash -675592251, now seen corresponding path program 2 times [2025-04-29 11:18:52,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:18:52,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922348528] [2025-04-29 11:18:52,013 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:18:52,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:18:52,018 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-29 11:18:52,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:18:52,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:18:52,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:52,236 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 11:18:52,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:18:52,236 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922348528] [2025-04-29 11:18:52,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922348528] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:18:52,236 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402063144] [2025-04-29 11:18:52,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:18:52,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:18:52,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:18:52,238 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:18:52,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-29 11:18:52,285 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-29 11:18:52,301 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:18:52,301 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:18:52,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:52,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-29 11:18:52,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:18:52,332 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:18:52,333 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:18:52,388 INFO L325 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2025-04-29 11:18:52,388 INFO L354 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 27 treesize of output 23 [2025-04-29 11:18:52,397 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-29 11:18:52,397 INFO L354 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 20 treesize of output 23 [2025-04-29 11:18:52,649 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:18:52,745 INFO L325 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2025-04-29 11:18:52,745 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 99 [2025-04-29 11:18:52,782 INFO L325 Elim1Store]: treesize reduction 48, result has 50.5 percent of original size [2025-04-29 11:18:52,782 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 95 treesize of output 106 [2025-04-29 11:18:52,818 INFO L325 Elim1Store]: treesize reduction 4, result has 91.8 percent of original size [2025-04-29 11:18:52,818 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 85 [2025-04-29 11:18:52,960 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:18:52,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:18:53,064 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-04-29 11:18:53,263 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (let ((.cse0 (select (store (select |c_#memory_$Pointer$#0.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (or (= .cse0 |ULTIMATE.start_sll_create_~new_head~0#1.base|) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_546) .cse0) 0) 0))))) (forall ((|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (let ((.cse1 (select (store (select |c_#memory_$Pointer$#0.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (or (= .cse1 |ULTIMATE.start_sll_create_~new_head~0#1.base|) (= (select (select |c_#memory_$Pointer$#0.base| .cse1) 0) 0))))) is different from false [2025-04-29 11:18:53,311 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-04-29 11:18:53,312 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-04-29 11:18:53,320 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 2 not checked. [2025-04-29 11:18:53,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402063144] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:18:53,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:18:53,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20, 20] total 38 [2025-04-29 11:18:53,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975062745] [2025-04-29 11:18:53,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:18:53,321 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-29 11:18:53,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:18:53,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-29 11:18:53,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1247, Unknown=1, NotChecked=70, Total=1406 [2025-04-29 11:18:53,321 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 38 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 38 states have internal predecessors, (74), 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-04-29 11:18:54,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:18:54,099 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2025-04-29 11:18:54,099 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-29 11:18:54,100 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 38 states have internal predecessors, (74), 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 39 [2025-04-29 11:18:54,100 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:18:54,100 INFO L225 Difference]: With dead ends: 125 [2025-04-29 11:18:54,100 INFO L226 Difference]: Without dead ends: 125 [2025-04-29 11:18:54,101 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=200, Invalid=2883, Unknown=1, NotChecked=108, Total=3192 [2025-04-29 11:18:54,101 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 16 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:18:54,101 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 505 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 897 Invalid, 0 Unknown, 65 Unchecked, 0.3s Time] [2025-04-29 11:18:54,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-04-29 11:18:54,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 111. [2025-04-29 11:18:54,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 104 states have (on average 1.1634615384615385) internal successors, (121), 110 states have internal predecessors, (121), 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-04-29 11:18:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2025-04-29 11:18:54,103 INFO L79 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 39 [2025-04-29 11:18:54,103 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:18:54,103 INFO L485 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2025-04-29 11:18:54,103 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 38 states have internal predecessors, (74), 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-04-29 11:18:54,103 INFO L278 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2025-04-29 11:18:54,103 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-29 11:18:54,103 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:18:54,103 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:18:54,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-29 11:18:54,304 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-29 11:18:54,304 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:18:54,304 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:18:54,304 INFO L85 PathProgramCache]: Analyzing trace with hash 606560090, now seen corresponding path program 3 times [2025-04-29 11:18:54,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:18:54,304 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055366818] [2025-04-29 11:18:54,304 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:18:54,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:18:54,310 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 5 equivalence classes. [2025-04-29 11:18:54,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:18:54,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-29 11:18:54,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:54,363 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 11:18:54,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:18:54,364 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055366818] [2025-04-29 11:18:54,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055366818] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:18:54,364 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894933830] [2025-04-29 11:18:54,364 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:18:54,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:18:54,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:18:54,366 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:18:54,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-29 11:18:54,422 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 5 equivalence classes. [2025-04-29 11:18:54,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:18:54,443 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-29 11:18:54,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:54,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:18:54,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:18:54,463 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 11:18:54,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:18:54,487 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 11:18:54,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894933830] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:18:54,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:18:54,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2025-04-29 11:18:54,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255630271] [2025-04-29 11:18:54,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:18:54,487 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:18:54,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:18:54,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:18:54,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:18:54,488 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:18:54,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:18:54,526 INFO L93 Difference]: Finished difference Result 163 states and 177 transitions. [2025-04-29 11:18:54,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:18:54,530 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-29 11:18:54,530 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:18:54,531 INFO L225 Difference]: With dead ends: 163 [2025-04-29 11:18:54,531 INFO L226 Difference]: Without dead ends: 163 [2025-04-29 11:18:54,531 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:18:54,531 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 28 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:18:54,531 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 128 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:18:54,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-04-29 11:18:54,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 129. [2025-04-29 11:18:54,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 122 states have (on average 1.1639344262295082) internal successors, (142), 128 states have internal predecessors, (142), 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-04-29 11:18:54,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2025-04-29 11:18:54,533 INFO L79 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 39 [2025-04-29 11:18:54,533 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:18:54,533 INFO L485 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions. [2025-04-29 11:18:54,533 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:18:54,533 INFO L278 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2025-04-29 11:18:54,533 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-29 11:18:54,533 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:18:54,533 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:18:54,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-29 11:18:54,734 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-29 11:18:54,734 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:18:54,734 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:18:54,734 INFO L85 PathProgramCache]: Analyzing trace with hash 531488686, now seen corresponding path program 2 times [2025-04-29 11:18:54,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:18:54,734 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741650644] [2025-04-29 11:18:54,734 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:18:54,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:18:54,739 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-29 11:18:54,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:18:54,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:18:54,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:55,024 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:18:55,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:18:55,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741650644] [2025-04-29 11:18:55,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741650644] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:18:55,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831829545] [2025-04-29 11:18:55,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:18:55,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:18:55,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:18:55,026 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:18:55,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-29 11:18:55,078 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-29 11:18:55,093 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:18:55,093 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:18:55,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:18:55,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-29 11:18:55,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:18:55,168 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:18:55,314 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:18:55,314 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 36 [2025-04-29 11:18:55,499 WARN L871 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_sll_destroy_~head#1.base_35| Int) (|v_ULTIMATE.start_sll_destroy_~head#1.base_34| Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_sll_destroy_~head#1.base_35|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_sll_destroy_~head#1.base_34| 0) |v_ULTIMATE.start_sll_destroy_~head#1.base_35| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_sll_destroy_~head#1.base_35| 1) |v_ULTIMATE.start_sll_destroy_~head#1.base_34|) 0))) is different from true [2025-04-29 11:18:55,506 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 2 not checked. [2025-04-29 11:18:55,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:18:55,699 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-04-29 11:18:55,701 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2025-04-29 11:19:08,114 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:19:08,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831829545] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:19:08,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:19:08,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 39 [2025-04-29 11:19:08,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820064101] [2025-04-29 11:19:08,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:08,115 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-29 11:19:08,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:08,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-29 11:19:08,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1382, Unknown=2, NotChecked=74, Total=1560 [2025-04-29 11:19:08,116 INFO L87 Difference]: Start difference. First operand 129 states and 142 transitions. Second operand has 40 states, 39 states have (on average 2.4871794871794872) internal successors, (97), 40 states have internal predecessors, (97), 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-04-29 11:19:08,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:08,820 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2025-04-29 11:19:08,820 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 11:19:08,820 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.4871794871794872) internal successors, (97), 40 states have internal predecessors, (97), 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 40 [2025-04-29 11:19:08,820 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:08,821 INFO L225 Difference]: With dead ends: 146 [2025-04-29 11:19:08,821 INFO L226 Difference]: Without dead ends: 111 [2025-04-29 11:19:08,821 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=157, Invalid=2101, Unknown=2, NotChecked=92, Total=2352 [2025-04-29 11:19:08,821 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 13 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:08,822 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 494 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 848 Invalid, 0 Unknown, 64 Unchecked, 0.4s Time] [2025-04-29 11:19:08,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-04-29 11:19:08,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-04-29 11:19:08,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 104 states have (on average 1.1634615384615385) internal successors, (121), 110 states have internal predecessors, (121), 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-04-29 11:19:08,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2025-04-29 11:19:08,823 INFO L79 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 40 [2025-04-29 11:19:08,823 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:08,823 INFO L485 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2025-04-29 11:19:08,823 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.4871794871794872) internal successors, (97), 40 states have internal predecessors, (97), 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-04-29 11:19:08,823 INFO L278 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2025-04-29 11:19:08,824 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-29 11:19:08,824 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:08,824 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:08,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:09,024 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-29 11:19:09,025 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:19:09,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:09,025 INFO L85 PathProgramCache]: Analyzing trace with hash 941203283, now seen corresponding path program 4 times [2025-04-29 11:19:09,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:09,025 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293809244] [2025-04-29 11:19:09,025 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:19:09,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:09,030 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-29 11:19:09,036 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 37 of 43 statements. [2025-04-29 11:19:09,036 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:19:09,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:09,541 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 29 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:19:09,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:09,541 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293809244] [2025-04-29 11:19:09,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293809244] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:09,542 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479224846] [2025-04-29 11:19:09,542 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:19:09,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:09,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:09,544 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:19:09,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-29 11:19:09,602 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-29 11:19:09,621 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 37 of 43 statements. [2025-04-29 11:19:09,621 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:19:09,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:09,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-04-29 11:19:09,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:09,627 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:19:09,639 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:19:09,639 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-29 11:19:09,667 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:19:09,709 INFO L325 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2025-04-29 11:19:09,709 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2025-04-29 11:19:09,755 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:19:09,761 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 21 [2025-04-29 11:19:09,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:09,859 INFO L325 Elim1Store]: treesize reduction 116, result has 31.0 percent of original size [2025-04-29 11:19:09,859 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 64 [2025-04-29 11:19:09,922 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-29 11:19:09,934 INFO L325 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2025-04-29 11:19:09,934 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 48 [2025-04-29 11:19:10,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:10,323 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:19:10,323 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 16 [2025-04-29 11:19:10,470 INFO L325 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2025-04-29 11:19:10,470 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 45 [2025-04-29 11:19:10,591 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 16 proven. 27 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:19:10,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:11,468 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2025-04-29 11:19:19,868 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:19:19,869 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 434 treesize of output 426 [2025-04-29 11:19:20,034 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-29 11:19:20,035 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 349 treesize of output 341 [2025-04-29 11:19:22,781 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 4 proven. 39 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:19:22,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479224846] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:19:22,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:19:22,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 53 [2025-04-29 11:19:22,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969381194] [2025-04-29 11:19:22,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:22,781 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-29 11:19:22,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:22,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-29 11:19:22,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2674, Unknown=1, NotChecked=0, Total=2862 [2025-04-29 11:19:22,782 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand has 54 states, 53 states have (on average 1.7169811320754718) internal successors, (91), 54 states have internal predecessors, (91), 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-04-29 11:19:24,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:24,663 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2025-04-29 11:19:24,664 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 11:19:24,664 INFO L79 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.7169811320754718) internal successors, (91), 54 states have internal predecessors, (91), 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 43 [2025-04-29 11:19:24,664 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:24,664 INFO L225 Difference]: With dead ends: 116 [2025-04-29 11:19:24,664 INFO L226 Difference]: Without dead ends: 116 [2025-04-29 11:19:24,665 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=341, Invalid=4080, Unknown=1, NotChecked=0, Total=4422 [2025-04-29 11:19:24,666 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:24,666 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 678 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-29 11:19:24,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-04-29 11:19:24,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2025-04-29 11:19:24,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 107 states have (on average 1.1775700934579438) internal successors, (126), 113 states have internal predecessors, (126), 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-04-29 11:19:24,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2025-04-29 11:19:24,668 INFO L79 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 43 [2025-04-29 11:19:24,668 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:24,668 INFO L485 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2025-04-29 11:19:24,668 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.7169811320754718) internal successors, (91), 54 states have internal predecessors, (91), 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-04-29 11:19:24,668 INFO L278 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2025-04-29 11:19:24,668 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-29 11:19:24,668 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:24,668 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:24,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:24,872 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:24,872 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-04-29 11:19:24,872 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:24,872 INFO L85 PathProgramCache]: Analyzing trace with hash 941203284, now seen corresponding path program 2 times [2025-04-29 11:19:24,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:24,872 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290050320] [2025-04-29 11:19:24,872 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:19:24,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:24,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-29 11:19:24,882 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:19:24,882 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:19:24,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:25,595 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:19:25,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:25,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290050320] [2025-04-29 11:19:25,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290050320] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:25,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584024091] [2025-04-29 11:19:25,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:19:25,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:25,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:25,597 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:19:25,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-29 11:19:25,654 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-29 11:19:25,673 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:19:25,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:19:25,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:25,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-04-29 11:19:25,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:25,684 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:19:25,688 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-29 11:19:25,769 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:19:25,769 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-29 11:19:25,783 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 11:19:25,783 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 11:19:25,825 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:19:25,828 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:19:25,905 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-29 11:19:25,905 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2025-04-29 11:19:25,930 INFO L325 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2025-04-29 11:19:25,930 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2025-04-29 11:19:26,002 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-29 11:19:26,014 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 34 [2025-04-29 11:19:26,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:26,137 INFO L325 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2025-04-29 11:19:26,137 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2025-04-29 11:19:26,144 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-04-29 11:19:26,220 INFO L325 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2025-04-29 11:19:26,220 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 54 [2025-04-29 11:19:26,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:26,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:26,230 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2025-04-29 11:19:26,898 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:19:26,928 INFO L325 Elim1Store]: treesize reduction 73, result has 20.7 percent of original size [2025-04-29 11:19:26,928 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 145 treesize of output 76 [2025-04-29 11:19:26,942 INFO L325 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2025-04-29 11:19:26,943 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 25 [2025-04-29 11:19:27,016 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 4 proven. 39 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:19:27,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... Killed by 15