./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/tree_cnstr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext/tree_cnstr.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 ba983053090b7e7410066c63fe0cfe9ad27960a7dc19d54045684ba21359c88d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:18:59,783 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:18:59,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:18:59,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:18:59,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:18:59,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:18:59,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:18:59,861 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:18:59,861 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:18:59,862 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:18:59,862 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:18:59,862 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:18:59,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:18:59,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:18:59,863 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:18:59,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:18:59,863 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:18:59,863 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:18:59,863 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:18:59,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:18:59,863 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:18:59,863 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:18:59,863 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:18:59,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:18:59,863 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:18:59,863 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:18:59,864 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:18:59,864 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:18:59,864 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:18:59,864 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:18:59,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:18:59,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:18:59,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:18:59,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:18:59,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:18:59,865 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:18:59,865 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:18:59,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:18:59,865 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:18:59,865 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:18:59,865 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:18:59,865 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:18:59,865 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-jdk21/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 -> ba983053090b7e7410066c63fe0cfe9ad27960a7dc19d54045684ba21359c88d [2025-02-06 10:19:00,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:19:00,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:19:00,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:19:00,114 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:19:00,114 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:19:00,114 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2025-02-06 10:19:01,246 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/442d8013d/95b4fdc99aaf451fab8c812ffc35338f/FLAG47c003f9b [2025-02-06 10:19:01,589 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:19:01,590 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2025-02-06 10:19:01,606 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/442d8013d/95b4fdc99aaf451fab8c812ffc35338f/FLAG47c003f9b [2025-02-06 10:19:01,832 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/442d8013d/95b4fdc99aaf451fab8c812ffc35338f [2025-02-06 10:19:01,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:19:01,836 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:19:01,837 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:19:01,838 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:19:01,841 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:19:01,842 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:19:01" (1/1) ... [2025-02-06 10:19:01,842 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@525c4489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:01, skipping insertion in model container [2025-02-06 10:19:01,843 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:19:01" (1/1) ... [2025-02-06 10:19:01,859 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:19:02,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:19:02,036 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:19:02,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:19:02,078 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:19:02,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:02 WrapperNode [2025-02-06 10:19:02,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:19:02,080 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:19:02,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:19:02,081 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:19:02,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:02" (1/1) ... [2025-02-06 10:19:02,096 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:02" (1/1) ... [2025-02-06 10:19:02,115 INFO L138 Inliner]: procedures = 123, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 131 [2025-02-06 10:19:02,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:19:02,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:19:02,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:19:02,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:19:02,125 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:02" (1/1) ... [2025-02-06 10:19:02,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:02" (1/1) ... [2025-02-06 10:19:02,127 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:02" (1/1) ... [2025-02-06 10:19:02,136 INFO L175 MemorySlicer]: Split 28 memory accesses to 2 slices as follows [2, 26]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2025-02-06 10:19:02,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:02" (1/1) ... [2025-02-06 10:19:02,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:02" (1/1) ... [2025-02-06 10:19:02,141 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:02" (1/1) ... [2025-02-06 10:19:02,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:02" (1/1) ... [2025-02-06 10:19:02,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:02" (1/1) ... [2025-02-06 10:19:02,142 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:02" (1/1) ... [2025-02-06 10:19:02,143 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:19:02,144 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:19:02,144 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:19:02,144 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:19:02,145 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:02" (1/1) ... [2025-02-06 10:19:02,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:19:02,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:19:02,167 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:19:02,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:19:02,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:19:02,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:19:02,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:19:02,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:19:02,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:19:02,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:19:02,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:19:02,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:19:02,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:19:02,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:19:02,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:19:02,249 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:19:02,250 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:19:02,522 INFO L? ?]: Removed 143 outVars from TransFormulas that were not future-live. [2025-02-06 10:19:02,522 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:19:02,530 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:19:02,530 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:19:02,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:19:02 BoogieIcfgContainer [2025-02-06 10:19:02,530 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:19:02,532 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:19:02,532 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:19:02,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:19:02,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:19:01" (1/3) ... [2025-02-06 10:19:02,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ed0938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:19:02, skipping insertion in model container [2025-02-06 10:19:02,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:19:02" (2/3) ... [2025-02-06 10:19:02,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ed0938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:19:02, skipping insertion in model container [2025-02-06 10:19:02,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:19:02" (3/3) ... [2025-02-06 10:19:02,536 INFO L128 eAbstractionObserver]: Analyzing ICFG tree_cnstr.i [2025-02-06 10:19:02,545 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:19:02,546 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tree_cnstr.i that has 1 procedures, 124 locations, 1 initial locations, 4 loop locations, and 56 error locations. [2025-02-06 10:19:02,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:19:02,578 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6d742ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:19:02,578 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2025-02-06 10:19:02,580 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 67 states have (on average 2.08955223880597) internal successors, (140), 123 states have internal predecessors, (140), 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-02-06 10:19:02,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 10:19:02,583 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:02,584 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 10:19:02,584 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:02,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:02,587 INFO L85 PathProgramCache]: Analyzing trace with hash 173742, now seen corresponding path program 1 times [2025-02-06 10:19:02,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:02,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84120400] [2025-02-06 10:19:02,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:02,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:02,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 10:19:02,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 10:19:02,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:02,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:02,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:02,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:02,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84120400] [2025-02-06 10:19:02,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84120400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:02,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:02,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:19:02,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086107261] [2025-02-06 10:19:02,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:02,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:19:02,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:02,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:19:02,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:02,715 INFO L87 Difference]: Start difference. First operand has 124 states, 67 states have (on average 2.08955223880597) internal successors, (140), 123 states have internal predecessors, (140), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-02-06 10:19:02,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:02,837 INFO L93 Difference]: Finished difference Result 163 states and 182 transitions. [2025-02-06 10:19:02,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:19:02,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2025-02-06 10:19:02,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:02,845 INFO L225 Difference]: With dead ends: 163 [2025-02-06 10:19:02,845 INFO L226 Difference]: Without dead ends: 161 [2025-02-06 10:19:02,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:02,868 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 123 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:02,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 109 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:19:02,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-02-06 10:19:02,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 120. [2025-02-06 10:19:02,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 66 states have (on average 2.015151515151515) internal successors, (133), 119 states have internal predecessors, (133), 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-02-06 10:19:02,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2025-02-06 10:19:02,899 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 3 [2025-02-06 10:19:02,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:02,899 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2025-02-06 10:19:02,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-02-06 10:19:02,900 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2025-02-06 10:19:02,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 10:19:02,900 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:02,900 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 10:19:02,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:19:02,900 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:02,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:02,901 INFO L85 PathProgramCache]: Analyzing trace with hash 173743, now seen corresponding path program 1 times [2025-02-06 10:19:02,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:02,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714926332] [2025-02-06 10:19:02,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:02,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:02,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 10:19:02,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 10:19:02,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:02,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:02,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:02,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:02,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714926332] [2025-02-06 10:19:02,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714926332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:02,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:02,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:19:02,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518306208] [2025-02-06 10:19:02,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:02,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:19:02,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:02,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:19:02,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:02,976 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-02-06 10:19:03,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:03,063 INFO L93 Difference]: Finished difference Result 159 states and 178 transitions. [2025-02-06 10:19:03,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:19:03,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2025-02-06 10:19:03,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:03,065 INFO L225 Difference]: With dead ends: 159 [2025-02-06 10:19:03,065 INFO L226 Difference]: Without dead ends: 159 [2025-02-06 10:19:03,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:03,066 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 124 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:03,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 111 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:19:03,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-06 10:19:03,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 118. [2025-02-06 10:19:03,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 66 states have (on average 1.9848484848484849) internal successors, (131), 117 states have internal predecessors, (131), 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-02-06 10:19:03,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 131 transitions. [2025-02-06 10:19:03,071 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 131 transitions. Word has length 3 [2025-02-06 10:19:03,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:03,071 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 131 transitions. [2025-02-06 10:19:03,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-02-06 10:19:03,071 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2025-02-06 10:19:03,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:19:03,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:03,071 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:03,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:19:03,071 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:03,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:03,072 INFO L85 PathProgramCache]: Analyzing trace with hash 616826490, now seen corresponding path program 1 times [2025-02-06 10:19:03,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:03,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178966307] [2025-02-06 10:19:03,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:03,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:03,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:19:03,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:19:03,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:03,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:03,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:03,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:03,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178966307] [2025-02-06 10:19:03,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178966307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:03,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:03,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:19:03,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896411086] [2025-02-06 10:19:03,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:03,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:19:03,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:03,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:19:03,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:19:03,118 INFO L87 Difference]: Start difference. First operand 118 states and 131 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:03,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:03,270 INFO L93 Difference]: Finished difference Result 148 states and 170 transitions. [2025-02-06 10:19:03,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:19:03,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 10:19:03,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:03,272 INFO L225 Difference]: With dead ends: 148 [2025-02-06 10:19:03,273 INFO L226 Difference]: Without dead ends: 148 [2025-02-06 10:19:03,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:19:03,274 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 205 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:03,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 81 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:19:03,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-02-06 10:19:03,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 107. [2025-02-06 10:19:03,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 71 states have (on average 1.732394366197183) internal successors, (123), 106 states have internal predecessors, (123), 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-02-06 10:19:03,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 123 transitions. [2025-02-06 10:19:03,282 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 123 transitions. Word has length 8 [2025-02-06 10:19:03,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:03,282 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 123 transitions. [2025-02-06 10:19:03,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:03,282 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 123 transitions. [2025-02-06 10:19:03,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:19:03,283 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:03,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:03,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:19:03,284 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:03,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:03,285 INFO L85 PathProgramCache]: Analyzing trace with hash 616826491, now seen corresponding path program 1 times [2025-02-06 10:19:03,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:03,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794230657] [2025-02-06 10:19:03,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:03,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:03,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:19:03,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:19:03,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:03,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:03,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:03,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:03,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794230657] [2025-02-06 10:19:03,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794230657] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:03,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:03,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:19:03,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477057773] [2025-02-06 10:19:03,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:03,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:19:03,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:03,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:19:03,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:19:03,422 INFO L87 Difference]: Start difference. First operand 107 states and 123 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:03,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:03,621 INFO L93 Difference]: Finished difference Result 209 states and 243 transitions. [2025-02-06 10:19:03,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:19:03,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 10:19:03,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:03,623 INFO L225 Difference]: With dead ends: 209 [2025-02-06 10:19:03,623 INFO L226 Difference]: Without dead ends: 209 [2025-02-06 10:19:03,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:19:03,624 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 244 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:03,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 132 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:19:03,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-06 10:19:03,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 177. [2025-02-06 10:19:03,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 141 states have (on average 1.673758865248227) internal successors, (236), 176 states have internal predecessors, (236), 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-02-06 10:19:03,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 236 transitions. [2025-02-06 10:19:03,636 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 236 transitions. Word has length 8 [2025-02-06 10:19:03,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:03,637 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 236 transitions. [2025-02-06 10:19:03,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:03,638 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 236 transitions. [2025-02-06 10:19:03,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 10:19:03,638 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:03,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:03,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:19:03,638 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:03,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:03,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1941644344, now seen corresponding path program 1 times [2025-02-06 10:19:03,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:03,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297943036] [2025-02-06 10:19:03,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:03,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:03,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 10:19:03,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 10:19:03,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:03,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:03,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:03,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:03,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297943036] [2025-02-06 10:19:03,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297943036] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:03,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:03,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:19:03,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21683191] [2025-02-06 10:19:03,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:03,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:19:03,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:03,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:19:03,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:03,698 INFO L87 Difference]: Start difference. First operand 177 states and 236 transitions. Second operand has 3 states, 3 states have (on average 3.0) 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-02-06 10:19:03,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:03,708 INFO L93 Difference]: Finished difference Result 191 states and 234 transitions. [2025-02-06 10:19:03,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:19:03,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) 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-02-06 10:19:03,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:03,711 INFO L225 Difference]: With dead ends: 191 [2025-02-06 10:19:03,711 INFO L226 Difference]: Without dead ends: 191 [2025-02-06 10:19:03,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:03,712 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 105 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:03,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 157 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:19:03,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-02-06 10:19:03,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 177. [2025-02-06 10:19:03,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 141 states have (on average 1.6595744680851063) internal successors, (234), 176 states have internal predecessors, (234), 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-02-06 10:19:03,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 234 transitions. [2025-02-06 10:19:03,717 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 234 transitions. Word has length 9 [2025-02-06 10:19:03,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:03,717 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 234 transitions. [2025-02-06 10:19:03,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) 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-02-06 10:19:03,717 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 234 transitions. [2025-02-06 10:19:03,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 10:19:03,718 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:03,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:03,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:19:03,718 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:03,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:03,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1020749714, now seen corresponding path program 1 times [2025-02-06 10:19:03,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:03,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515118289] [2025-02-06 10:19:03,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:03,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:03,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 10:19:03,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 10:19:03,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:03,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:03,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:03,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:03,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515118289] [2025-02-06 10:19:03,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515118289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:03,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:03,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:19:03,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296978021] [2025-02-06 10:19:03,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:03,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:19:03,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:03,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:19:03,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:03,770 INFO L87 Difference]: Start difference. First operand 177 states and 234 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-02-06 10:19:03,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:03,781 INFO L93 Difference]: Finished difference Result 180 states and 237 transitions. [2025-02-06 10:19:03,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:19:03,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2025-02-06 10:19:03,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:03,782 INFO L225 Difference]: With dead ends: 180 [2025-02-06 10:19:03,782 INFO L226 Difference]: Without dead ends: 180 [2025-02-06 10:19:03,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:03,783 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:03,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:19:03,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-02-06 10:19:03,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-02-06 10:19:03,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 144 states have (on average 1.6458333333333333) internal successors, (237), 179 states have internal predecessors, (237), 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-02-06 10:19:03,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 237 transitions. [2025-02-06 10:19:03,787 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 237 transitions. Word has length 15 [2025-02-06 10:19:03,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:03,787 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 237 transitions. [2025-02-06 10:19:03,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-02-06 10:19:03,787 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 237 transitions. [2025-02-06 10:19:03,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:19:03,792 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:03,792 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:03,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:19:03,792 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:03,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:03,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1768989359, now seen corresponding path program 1 times [2025-02-06 10:19:03,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:03,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689310560] [2025-02-06 10:19:03,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:03,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:03,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:19:03,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:19:03,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:03,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:03,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:03,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:03,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689310560] [2025-02-06 10:19:03,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689310560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:03,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:03,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:19:03,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87852713] [2025-02-06 10:19:03,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:03,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:19:03,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:03,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:19:03,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:03,832 INFO L87 Difference]: Start difference. First operand 180 states and 237 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-02-06 10:19:03,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:03,839 INFO L93 Difference]: Finished difference Result 182 states and 239 transitions. [2025-02-06 10:19:03,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:19:03,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2025-02-06 10:19:03,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:03,841 INFO L225 Difference]: With dead ends: 182 [2025-02-06 10:19:03,841 INFO L226 Difference]: Without dead ends: 182 [2025-02-06 10:19:03,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:03,841 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:03,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:19:03,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-02-06 10:19:03,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2025-02-06 10:19:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 146 states have (on average 1.6369863013698631) internal successors, (239), 181 states have internal predecessors, (239), 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-02-06 10:19:03,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 239 transitions. [2025-02-06 10:19:03,849 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 239 transitions. Word has length 16 [2025-02-06 10:19:03,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:03,850 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 239 transitions. [2025-02-06 10:19:03,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-02-06 10:19:03,850 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 239 transitions. [2025-02-06 10:19:03,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 10:19:03,850 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:03,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:03,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:19:03,854 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:03,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:03,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1655976754, now seen corresponding path program 1 times [2025-02-06 10:19:03,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:03,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098234146] [2025-02-06 10:19:03,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:03,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:03,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 10:19:03,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 10:19:03,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:03,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:03,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:03,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:03,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098234146] [2025-02-06 10:19:03,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098234146] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:03,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:03,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:19:03,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970880815] [2025-02-06 10:19:03,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:03,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:19:03,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:03,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:19:03,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:03,902 INFO L87 Difference]: Start difference. First operand 182 states and 239 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-02-06 10:19:03,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:03,919 INFO L93 Difference]: Finished difference Result 189 states and 240 transitions. [2025-02-06 10:19:03,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:19:03,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2025-02-06 10:19:03,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:03,920 INFO L225 Difference]: With dead ends: 189 [2025-02-06 10:19:03,920 INFO L226 Difference]: Without dead ends: 189 [2025-02-06 10:19:03,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:03,921 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 4 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:03,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 217 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:19:03,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-02-06 10:19:03,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 185. [2025-02-06 10:19:03,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 149 states have (on average 1.604026845637584) internal successors, (239), 184 states have internal predecessors, (239), 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-02-06 10:19:03,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 239 transitions. [2025-02-06 10:19:03,929 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 239 transitions. Word has length 17 [2025-02-06 10:19:03,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:03,929 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 239 transitions. [2025-02-06 10:19:03,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-02-06 10:19:03,929 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 239 transitions. [2025-02-06 10:19:03,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 10:19:03,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:03,930 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:03,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:19:03,930 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:03,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:03,931 INFO L85 PathProgramCache]: Analyzing trace with hash 204326883, now seen corresponding path program 1 times [2025-02-06 10:19:03,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:03,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484232055] [2025-02-06 10:19:03,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:03,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:03,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 10:19:03,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 10:19:03,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:03,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:03,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:03,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:03,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484232055] [2025-02-06 10:19:03,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484232055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:03,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:03,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:19:03,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95497233] [2025-02-06 10:19:03,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:03,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:19:03,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:03,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:19:03,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:19:03,996 INFO L87 Difference]: Start difference. First operand 185 states and 239 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-02-06 10:19:04,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:04,089 INFO L93 Difference]: Finished difference Result 210 states and 245 transitions. [2025-02-06 10:19:04,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:19:04,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-02-06 10:19:04,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:04,091 INFO L225 Difference]: With dead ends: 210 [2025-02-06 10:19:04,091 INFO L226 Difference]: Without dead ends: 210 [2025-02-06 10:19:04,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:19:04,091 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 215 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:04,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 194 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:19:04,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-02-06 10:19:04,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 186. [2025-02-06 10:19:04,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 150 states have (on average 1.6) internal successors, (240), 185 states have internal predecessors, (240), 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-02-06 10:19:04,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 240 transitions. [2025-02-06 10:19:04,095 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 240 transitions. Word has length 18 [2025-02-06 10:19:04,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:04,095 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 240 transitions. [2025-02-06 10:19:04,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-02-06 10:19:04,095 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 240 transitions. [2025-02-06 10:19:04,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 10:19:04,096 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:04,096 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:04,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:19:04,096 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:04,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:04,097 INFO L85 PathProgramCache]: Analyzing trace with hash -2142483409, now seen corresponding path program 1 times [2025-02-06 10:19:04,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:04,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280465859] [2025-02-06 10:19:04,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:04,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:04,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 10:19:04,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 10:19:04,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:04,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:04,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:04,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:04,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280465859] [2025-02-06 10:19:04,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280465859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:04,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:04,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:19:04,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239336301] [2025-02-06 10:19:04,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:04,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:19:04,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:04,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:19:04,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:19:04,271 INFO L87 Difference]: Start difference. First operand 186 states and 240 transitions. Second operand has 6 states, 6 states have (on average 3.0) 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-02-06 10:19:04,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:04,456 INFO L93 Difference]: Finished difference Result 269 states and 338 transitions. [2025-02-06 10:19:04,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:19:04,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) 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-02-06 10:19:04,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:04,458 INFO L225 Difference]: With dead ends: 269 [2025-02-06 10:19:04,460 INFO L226 Difference]: Without dead ends: 269 [2025-02-06 10:19:04,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:19:04,461 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 110 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:04,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 427 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:19:04,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-02-06 10:19:04,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 201. [2025-02-06 10:19:04,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 165 states have (on average 1.5757575757575757) internal successors, (260), 200 states have internal predecessors, (260), 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-02-06 10:19:04,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 260 transitions. [2025-02-06 10:19:04,467 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 260 transitions. Word has length 18 [2025-02-06 10:19:04,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:04,468 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 260 transitions. [2025-02-06 10:19:04,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) 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-02-06 10:19:04,468 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 260 transitions. [2025-02-06 10:19:04,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:19:04,468 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:04,468 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:04,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:19:04,468 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:04,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:04,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1684337874, now seen corresponding path program 1 times [2025-02-06 10:19:04,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:04,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870062826] [2025-02-06 10:19:04,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:04,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:04,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:19:04,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:19:04,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:04,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:04,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:04,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:04,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870062826] [2025-02-06 10:19:04,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870062826] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:04,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:04,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:19:04,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516022146] [2025-02-06 10:19:04,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:04,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:19:04,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:04,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:19:04,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:19:04,657 INFO L87 Difference]: Start difference. First operand 201 states and 260 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-02-06 10:19:04,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:04,834 INFO L93 Difference]: Finished difference Result 268 states and 336 transitions. [2025-02-06 10:19:04,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:19:04,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 19 [2025-02-06 10:19:04,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:04,838 INFO L225 Difference]: With dead ends: 268 [2025-02-06 10:19:04,838 INFO L226 Difference]: Without dead ends: 268 [2025-02-06 10:19:04,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:19:04,839 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 105 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:04,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 432 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:19:04,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-02-06 10:19:04,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 239. [2025-02-06 10:19:04,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 203 states have (on average 1.5763546798029557) internal successors, (320), 238 states have internal predecessors, (320), 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-02-06 10:19:04,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 320 transitions. [2025-02-06 10:19:04,845 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 320 transitions. Word has length 19 [2025-02-06 10:19:04,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:04,845 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 320 transitions. [2025-02-06 10:19:04,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-02-06 10:19:04,845 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 320 transitions. [2025-02-06 10:19:04,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:19:04,846 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:04,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:04,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 10:19:04,846 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:04,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:04,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1024829464, now seen corresponding path program 1 times [2025-02-06 10:19:04,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:04,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669397006] [2025-02-06 10:19:04,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:04,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:04,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:19:04,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:19:04,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:04,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:04,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:04,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:04,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669397006] [2025-02-06 10:19:04,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669397006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:04,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:04,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:19:04,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621097005] [2025-02-06 10:19:04,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:04,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:19:04,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:04,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:19:04,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:19:04,917 INFO L87 Difference]: Start difference. First operand 239 states and 320 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-02-06 10:19:05,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:05,017 INFO L93 Difference]: Finished difference Result 238 states and 318 transitions. [2025-02-06 10:19:05,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:19:05,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2025-02-06 10:19:05,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:05,018 INFO L225 Difference]: With dead ends: 238 [2025-02-06 10:19:05,018 INFO L226 Difference]: Without dead ends: 238 [2025-02-06 10:19:05,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:19:05,019 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 3 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:05,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 292 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:19:05,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-02-06 10:19:05,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2025-02-06 10:19:05,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.5665024630541873) internal successors, (318), 237 states have internal predecessors, (318), 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-02-06 10:19:05,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 318 transitions. [2025-02-06 10:19:05,023 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 318 transitions. Word has length 19 [2025-02-06 10:19:05,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:05,023 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 318 transitions. [2025-02-06 10:19:05,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-02-06 10:19:05,023 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 318 transitions. [2025-02-06 10:19:05,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:19:05,023 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:05,023 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:05,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:19:05,024 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:05,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:05,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1024829465, now seen corresponding path program 1 times [2025-02-06 10:19:05,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:05,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344958054] [2025-02-06 10:19:05,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:05,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:05,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:19:05,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:19:05,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:05,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:05,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:05,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:05,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344958054] [2025-02-06 10:19:05,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344958054] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:05,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:05,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:19:05,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815439457] [2025-02-06 10:19:05,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:05,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:19:05,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:05,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:19:05,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:19:05,176 INFO L87 Difference]: Start difference. First operand 238 states and 318 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-02-06 10:19:05,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:05,312 INFO L93 Difference]: Finished difference Result 237 states and 316 transitions. [2025-02-06 10:19:05,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:19:05,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2025-02-06 10:19:05,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:05,314 INFO L225 Difference]: With dead ends: 237 [2025-02-06 10:19:05,314 INFO L226 Difference]: Without dead ends: 237 [2025-02-06 10:19:05,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:19:05,314 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 2 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:05,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 269 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:19:05,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-02-06 10:19:05,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2025-02-06 10:19:05,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 203 states have (on average 1.5566502463054188) internal successors, (316), 236 states have internal predecessors, (316), 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-02-06 10:19:05,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 316 transitions. [2025-02-06 10:19:05,323 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 316 transitions. Word has length 19 [2025-02-06 10:19:05,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:05,323 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 316 transitions. [2025-02-06 10:19:05,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-02-06 10:19:05,323 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 316 transitions. [2025-02-06 10:19:05,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 10:19:05,323 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:05,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:05,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 10:19:05,323 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:05,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:05,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1133487168, now seen corresponding path program 1 times [2025-02-06 10:19:05,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:05,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435775085] [2025-02-06 10:19:05,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:05,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:05,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 10:19:05,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 10:19:05,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:05,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:05,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:05,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:05,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435775085] [2025-02-06 10:19:05,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435775085] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:19:05,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717565541] [2025-02-06 10:19:05,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:05,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:05,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:19:05,423 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:19:05,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:19:05,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 10:19:05,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 10:19:05,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:05,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:05,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 10:19:05,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:19:05,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:19:05,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:05,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:19:05,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:05,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717565541] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:19:05,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:19:05,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-02-06 10:19:05,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100459718] [2025-02-06 10:19:05,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:19:05,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:19:05,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:05,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:19:05,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:19:05,638 INFO L87 Difference]: Start difference. First operand 237 states and 316 transitions. Second operand has 6 states, 5 states have (on average 4.8) 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-02-06 10:19:05,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:05,847 INFO L93 Difference]: Finished difference Result 336 states and 433 transitions. [2025-02-06 10:19:05,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:19:05,848 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) 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 21 [2025-02-06 10:19:05,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:05,849 INFO L225 Difference]: With dead ends: 336 [2025-02-06 10:19:05,849 INFO L226 Difference]: Without dead ends: 335 [2025-02-06 10:19:05,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:19:05,850 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 130 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:05,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 410 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:19:05,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-02-06 10:19:05,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 247. [2025-02-06 10:19:05,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 213 states have (on average 1.5352112676056338) internal successors, (327), 246 states have internal predecessors, (327), 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-02-06 10:19:05,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 327 transitions. [2025-02-06 10:19:05,862 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 327 transitions. Word has length 21 [2025-02-06 10:19:05,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:05,863 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 327 transitions. [2025-02-06 10:19:05,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) 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-02-06 10:19:05,863 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 327 transitions. [2025-02-06 10:19:05,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 10:19:05,863 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:05,863 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:05,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 10:19:06,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-06 10:19:06,064 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:06,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:06,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1907552370, now seen corresponding path program 1 times [2025-02-06 10:19:06,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:06,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841833798] [2025-02-06 10:19:06,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:06,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:06,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 10:19:06,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 10:19:06,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:06,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:06,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:06,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:06,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841833798] [2025-02-06 10:19:06,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841833798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:06,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:06,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:19:06,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822133753] [2025-02-06 10:19:06,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:06,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:19:06,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:06,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:19:06,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:19:06,211 INFO L87 Difference]: Start difference. First operand 247 states and 327 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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-02-06 10:19:06,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:06,461 INFO L93 Difference]: Finished difference Result 340 states and 422 transitions. [2025-02-06 10:19:06,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:19:06,462 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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-02-06 10:19:06,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:06,463 INFO L225 Difference]: With dead ends: 340 [2025-02-06 10:19:06,463 INFO L226 Difference]: Without dead ends: 340 [2025-02-06 10:19:06,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:19:06,463 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 271 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:06,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 439 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:19:06,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-02-06 10:19:06,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 302. [2025-02-06 10:19:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 268 states have (on average 1.5111940298507462) internal successors, (405), 301 states have internal predecessors, (405), 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-02-06 10:19:06,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 405 transitions. [2025-02-06 10:19:06,470 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 405 transitions. Word has length 21 [2025-02-06 10:19:06,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:06,470 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 405 transitions. [2025-02-06 10:19:06,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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-02-06 10:19:06,470 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 405 transitions. [2025-02-06 10:19:06,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 10:19:06,470 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:06,471 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:06,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 10:19:06,471 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:06,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:06,471 INFO L85 PathProgramCache]: Analyzing trace with hash 778412496, now seen corresponding path program 1 times [2025-02-06 10:19:06,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:06,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366421691] [2025-02-06 10:19:06,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:06,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:06,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 10:19:06,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 10:19:06,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:06,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:06,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:06,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:06,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366421691] [2025-02-06 10:19:06,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366421691] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:06,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:06,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:19:06,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664719283] [2025-02-06 10:19:06,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:06,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:19:06,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:06,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:19:06,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:06,509 INFO L87 Difference]: Start difference. First operand 302 states and 405 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-02-06 10:19:06,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:06,517 INFO L93 Difference]: Finished difference Result 277 states and 354 transitions. [2025-02-06 10:19:06,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:19:06,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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 22 [2025-02-06 10:19:06,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:06,518 INFO L225 Difference]: With dead ends: 277 [2025-02-06 10:19:06,518 INFO L226 Difference]: Without dead ends: 263 [2025-02-06 10:19:06,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:19:06,519 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 2 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:06,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 218 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:19:06,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-02-06 10:19:06,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2025-02-06 10:19:06,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 227 states have (on average 1.497797356828194) internal successors, (340), 260 states have internal predecessors, (340), 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-02-06 10:19:06,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 340 transitions. [2025-02-06 10:19:06,523 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 340 transitions. Word has length 22 [2025-02-06 10:19:06,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:06,523 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 340 transitions. [2025-02-06 10:19:06,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-02-06 10:19:06,524 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 340 transitions. [2025-02-06 10:19:06,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 10:19:06,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:06,524 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:06,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 10:19:06,524 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:06,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:06,524 INFO L85 PathProgramCache]: Analyzing trace with hash 2067078558, now seen corresponding path program 1 times [2025-02-06 10:19:06,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:06,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2734866] [2025-02-06 10:19:06,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:06,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:06,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 10:19:06,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 10:19:06,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:06,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:06,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:06,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:06,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2734866] [2025-02-06 10:19:06,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2734866] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:06,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:06,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:19:06,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394852912] [2025-02-06 10:19:06,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:06,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:19:06,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:06,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:19:06,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:19:06,639 INFO L87 Difference]: Start difference. First operand 261 states and 340 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 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-02-06 10:19:06,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:06,867 INFO L93 Difference]: Finished difference Result 266 states and 344 transitions. [2025-02-06 10:19:06,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:19:06,867 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 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 22 [2025-02-06 10:19:06,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:06,868 INFO L225 Difference]: With dead ends: 266 [2025-02-06 10:19:06,868 INFO L226 Difference]: Without dead ends: 266 [2025-02-06 10:19:06,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:19:06,869 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 62 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:06,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 294 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:19:06,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-02-06 10:19:06,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 260. [2025-02-06 10:19:06,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 227 states have (on average 1.4845814977973568) internal successors, (337), 259 states have internal predecessors, (337), 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-02-06 10:19:06,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 337 transitions. [2025-02-06 10:19:06,873 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 337 transitions. Word has length 22 [2025-02-06 10:19:06,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:06,873 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 337 transitions. [2025-02-06 10:19:06,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 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-02-06 10:19:06,873 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 337 transitions. [2025-02-06 10:19:06,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 10:19:06,873 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:06,874 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:06,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 10:19:06,874 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:06,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:06,874 INFO L85 PathProgramCache]: Analyzing trace with hash 2067078559, now seen corresponding path program 1 times [2025-02-06 10:19:06,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:06,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719476467] [2025-02-06 10:19:06,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:06,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:06,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 10:19:06,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 10:19:06,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:06,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:07,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:07,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:07,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719476467] [2025-02-06 10:19:07,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719476467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:07,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:07,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:19:07,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822634153] [2025-02-06 10:19:07,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:07,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:19:07,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:07,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:19:07,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:19:07,025 INFO L87 Difference]: Start difference. First operand 260 states and 337 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 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-02-06 10:19:07,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:07,219 INFO L93 Difference]: Finished difference Result 265 states and 341 transitions. [2025-02-06 10:19:07,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:19:07,219 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 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 22 [2025-02-06 10:19:07,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:07,221 INFO L225 Difference]: With dead ends: 265 [2025-02-06 10:19:07,221 INFO L226 Difference]: Without dead ends: 265 [2025-02-06 10:19:07,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:19:07,222 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 61 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:07,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 203 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:19:07,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-02-06 10:19:07,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 259. [2025-02-06 10:19:07,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 227 states have (on average 1.47136563876652) internal successors, (334), 258 states have internal predecessors, (334), 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-02-06 10:19:07,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 334 transitions. [2025-02-06 10:19:07,226 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 334 transitions. Word has length 22 [2025-02-06 10:19:07,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:07,227 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 334 transitions. [2025-02-06 10:19:07,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 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-02-06 10:19:07,227 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 334 transitions. [2025-02-06 10:19:07,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 10:19:07,227 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:07,227 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:07,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 10:19:07,227 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:07,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:07,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1539402679, now seen corresponding path program 1 times [2025-02-06 10:19:07,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:07,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655311912] [2025-02-06 10:19:07,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:07,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:07,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 10:19:07,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 10:19:07,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:07,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:07,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:07,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:07,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655311912] [2025-02-06 10:19:07,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655311912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:07,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:07,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:19:07,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382108579] [2025-02-06 10:19:07,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:07,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:19:07,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:07,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:19:07,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:19:07,356 INFO L87 Difference]: Start difference. First operand 259 states and 334 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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-02-06 10:19:07,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:07,470 INFO L93 Difference]: Finished difference Result 258 states and 332 transitions. [2025-02-06 10:19:07,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:19:07,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 23 [2025-02-06 10:19:07,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:07,472 INFO L225 Difference]: With dead ends: 258 [2025-02-06 10:19:07,472 INFO L226 Difference]: Without dead ends: 258 [2025-02-06 10:19:07,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:19:07,473 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 3 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:07,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 259 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:19:07,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-02-06 10:19:07,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2025-02-06 10:19:07,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 227 states have (on average 1.4625550660792952) internal successors, (332), 257 states have internal predecessors, (332), 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-02-06 10:19:07,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 332 transitions. [2025-02-06 10:19:07,477 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 332 transitions. Word has length 23 [2025-02-06 10:19:07,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:07,478 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 332 transitions. [2025-02-06 10:19:07,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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-02-06 10:19:07,478 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 332 transitions. [2025-02-06 10:19:07,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 10:19:07,478 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:07,478 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:07,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 10:19:07,479 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:07,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:07,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1539402678, now seen corresponding path program 1 times [2025-02-06 10:19:07,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:07,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927262097] [2025-02-06 10:19:07,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:07,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:07,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 10:19:07,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 10:19:07,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:07,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:07,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:07,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:07,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927262097] [2025-02-06 10:19:07,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927262097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:07,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:07,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:19:07,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286472792] [2025-02-06 10:19:07,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:07,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:19:07,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:07,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:19:07,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:19:07,539 INFO L87 Difference]: Start difference. First operand 258 states and 332 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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-02-06 10:19:07,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:07,635 INFO L93 Difference]: Finished difference Result 257 states and 330 transitions. [2025-02-06 10:19:07,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:19:07,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 23 [2025-02-06 10:19:07,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:07,636 INFO L225 Difference]: With dead ends: 257 [2025-02-06 10:19:07,637 INFO L226 Difference]: Without dead ends: 257 [2025-02-06 10:19:07,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:19:07,638 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 2 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:07,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 282 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:19:07,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-02-06 10:19:07,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2025-02-06 10:19:07,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 227 states have (on average 1.4537444933920705) internal successors, (330), 256 states have internal predecessors, (330), 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-02-06 10:19:07,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 330 transitions. [2025-02-06 10:19:07,643 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 330 transitions. Word has length 23 [2025-02-06 10:19:07,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:07,644 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 330 transitions. [2025-02-06 10:19:07,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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-02-06 10:19:07,644 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 330 transitions. [2025-02-06 10:19:07,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 10:19:07,644 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:07,644 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:07,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 10:19:07,644 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:07,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:07,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1315575706, now seen corresponding path program 1 times [2025-02-06 10:19:07,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:07,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070359797] [2025-02-06 10:19:07,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:07,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:07,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:19:07,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:19:07,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:07,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:07,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:07,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:07,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070359797] [2025-02-06 10:19:07,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070359797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:07,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:07,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:19:07,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760732643] [2025-02-06 10:19:07,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:07,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:19:07,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:07,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:19:07,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:19:07,763 INFO L87 Difference]: Start difference. First operand 257 states and 330 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 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-02-06 10:19:07,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:07,951 INFO L93 Difference]: Finished difference Result 262 states and 336 transitions. [2025-02-06 10:19:07,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:19:07,952 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 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 26 [2025-02-06 10:19:07,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:07,952 INFO L225 Difference]: With dead ends: 262 [2025-02-06 10:19:07,952 INFO L226 Difference]: Without dead ends: 262 [2025-02-06 10:19:07,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:19:07,953 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 53 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:07,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 201 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:19:07,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-02-06 10:19:07,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 256. [2025-02-06 10:19:07,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 227 states have (on average 1.449339207048458) internal successors, (329), 255 states have internal predecessors, (329), 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-02-06 10:19:07,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 329 transitions. [2025-02-06 10:19:07,958 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 329 transitions. Word has length 26 [2025-02-06 10:19:07,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:07,958 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 329 transitions. [2025-02-06 10:19:07,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 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-02-06 10:19:07,958 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 329 transitions. [2025-02-06 10:19:07,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 10:19:07,958 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:07,958 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:07,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 10:19:07,959 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:07,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:07,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1315575705, now seen corresponding path program 1 times [2025-02-06 10:19:07,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:07,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833633197] [2025-02-06 10:19:07,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:07,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:07,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:19:07,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:19:07,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:07,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:08,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:08,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833633197] [2025-02-06 10:19:08,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833633197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:08,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:08,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:19:08,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194128784] [2025-02-06 10:19:08,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:08,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:19:08,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:08,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:19:08,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:19:08,165 INFO L87 Difference]: Start difference. First operand 256 states and 329 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 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-02-06 10:19:08,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:08,396 INFO L93 Difference]: Finished difference Result 261 states and 335 transitions. [2025-02-06 10:19:08,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:19:08,397 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 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 26 [2025-02-06 10:19:08,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:08,398 INFO L225 Difference]: With dead ends: 261 [2025-02-06 10:19:08,398 INFO L226 Difference]: Without dead ends: 261 [2025-02-06 10:19:08,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:19:08,400 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 53 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:08,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 269 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:19:08,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-02-06 10:19:08,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 255. [2025-02-06 10:19:08,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 227 states have (on average 1.4449339207048457) internal successors, (328), 254 states have internal predecessors, (328), 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-02-06 10:19:08,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 328 transitions. [2025-02-06 10:19:08,406 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 328 transitions. Word has length 26 [2025-02-06 10:19:08,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:08,406 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 328 transitions. [2025-02-06 10:19:08,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 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-02-06 10:19:08,406 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 328 transitions. [2025-02-06 10:19:08,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-06 10:19:08,406 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:08,406 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:08,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 10:19:08,406 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:08,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:08,407 INFO L85 PathProgramCache]: Analyzing trace with hash -464347741, now seen corresponding path program 1 times [2025-02-06 10:19:08,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:08,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647975710] [2025-02-06 10:19:08,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:08,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:08,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 10:19:08,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 10:19:08,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:08,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:09,064 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:19:09,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:09,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647975710] [2025-02-06 10:19:09,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647975710] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:19:09,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558636564] [2025-02-06 10:19:09,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:09,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:09,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:19:09,067 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:19:09,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 10:19:09,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 10:19:09,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 10:19:09,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:09,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:09,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 10:19:09,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:19:09,346 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:09,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:19:09,430 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-02-06 10:19:09,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2025-02-06 10:19:09,436 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-02-06 10:19:09,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2025-02-06 10:19:09,489 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:09,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558636564] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:19:09,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:19:09,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 25 [2025-02-06 10:19:09,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132919649] [2025-02-06 10:19:09,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:19:09,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 10:19:09,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:09,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 10:19:09,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2025-02-06 10:19:09,495 INFO L87 Difference]: Start difference. First operand 255 states and 328 transitions. Second operand has 25 states, 25 states have (on average 3.12) internal successors, (78), 25 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-02-06 10:19:10,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:10,557 INFO L93 Difference]: Finished difference Result 412 states and 501 transitions. [2025-02-06 10:19:10,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-06 10:19:10,557 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.12) internal successors, (78), 25 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) Word has length 41 [2025-02-06 10:19:10,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:10,558 INFO L225 Difference]: With dead ends: 412 [2025-02-06 10:19:10,558 INFO L226 Difference]: Without dead ends: 412 [2025-02-06 10:19:10,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=594, Invalid=2058, Unknown=0, NotChecked=0, Total=2652 [2025-02-06 10:19:10,560 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 685 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:10,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 971 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 10:19:10,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-02-06 10:19:10,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 255. [2025-02-06 10:19:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 227 states have (on average 1.3876651982378854) internal successors, (315), 254 states have internal predecessors, (315), 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-02-06 10:19:10,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 315 transitions. [2025-02-06 10:19:10,564 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 315 transitions. Word has length 41 [2025-02-06 10:19:10,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:10,564 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 315 transitions. [2025-02-06 10:19:10,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.12) internal successors, (78), 25 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-02-06 10:19:10,564 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 315 transitions. [2025-02-06 10:19:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-06 10:19:10,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:10,565 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:10,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 10:19:10,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:10,766 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:10,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:10,766 INFO L85 PathProgramCache]: Analyzing trace with hash -997751261, now seen corresponding path program 1 times [2025-02-06 10:19:10,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:10,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763438331] [2025-02-06 10:19:10,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:10,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:10,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 10:19:10,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 10:19:10,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:10,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:11,144 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:11,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:11,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763438331] [2025-02-06 10:19:11,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763438331] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:19:11,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207142243] [2025-02-06 10:19:11,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:11,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:11,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:19:11,150 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:19:11,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 10:19:11,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 10:19:11,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 10:19:11,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:11,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:11,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 10:19:11,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:19:11,300 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:19:11,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:19:11,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 10:19:11,387 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:19:11,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 10:19:11,444 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:19:11,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 10:19:11,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 10:19:11,535 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:11,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:19:11,590 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_531 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_531) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) 1)) is different from false [2025-02-06 10:19:11,596 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_531 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_531) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) 1)) is different from false [2025-02-06 10:19:11,610 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-02-06 10:19:11,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2025-02-06 10:19:11,616 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_531 (Array Int Int)) (v_ArrVal_530 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_530))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_531)) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4)) |c_ULTIMATE.start_main_#t~mem21#1.base|)) is different from false [2025-02-06 10:19:11,624 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_531 (Array Int Int)) (v_ArrVal_530 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_530))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_531)) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4)))))) is different from false [2025-02-06 10:19:11,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:11,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 35 [2025-02-06 10:19:11,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:11,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 162 treesize of output 137 [2025-02-06 10:19:11,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 78 [2025-02-06 10:19:11,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:11,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 66 [2025-02-06 10:19:11,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:11,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 46 [2025-02-06 10:19:11,982 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:11,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207142243] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:19:11,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:19:11,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 31 [2025-02-06 10:19:11,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829809360] [2025-02-06 10:19:11,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:19:11,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-06 10:19:11,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:11,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 10:19:11,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=612, Unknown=4, NotChecked=212, Total=930 [2025-02-06 10:19:11,984 INFO L87 Difference]: Start difference. First operand 255 states and 315 transitions. Second operand has 31 states, 31 states have (on average 3.4193548387096775) internal successors, (106), 31 states have internal predecessors, (106), 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-02-06 10:19:13,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:13,670 INFO L93 Difference]: Finished difference Result 650 states and 805 transitions. [2025-02-06 10:19:13,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-02-06 10:19:13,671 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.4193548387096775) internal successors, (106), 31 states have internal predecessors, (106), 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 41 [2025-02-06 10:19:13,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:13,672 INFO L225 Difference]: With dead ends: 650 [2025-02-06 10:19:13,672 INFO L226 Difference]: Without dead ends: 650 [2025-02-06 10:19:13,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=518, Invalid=2686, Unknown=4, NotChecked=452, Total=3660 [2025-02-06 10:19:13,674 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 621 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 2149 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 4174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 2149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1957 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:13,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 1511 Invalid, 4174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 2149 Invalid, 0 Unknown, 1957 Unchecked, 1.0s Time] [2025-02-06 10:19:13,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-02-06 10:19:13,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 353. [2025-02-06 10:19:13,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 325 states have (on average 1.3815384615384616) internal successors, (449), 352 states have internal predecessors, (449), 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-02-06 10:19:13,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 449 transitions. [2025-02-06 10:19:13,680 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 449 transitions. Word has length 41 [2025-02-06 10:19:13,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:13,680 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 449 transitions. [2025-02-06 10:19:13,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.4193548387096775) internal successors, (106), 31 states have internal predecessors, (106), 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-02-06 10:19:13,681 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 449 transitions. [2025-02-06 10:19:13,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:19:13,681 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:13,681 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:13,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 10:19:13,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:13,885 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:13,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:13,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1201739718, now seen corresponding path program 1 times [2025-02-06 10:19:13,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:13,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728342701] [2025-02-06 10:19:13,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:13,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:13,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:19:13,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:19:13,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:13,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:13,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:19:13,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:13,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728342701] [2025-02-06 10:19:13,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728342701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:13,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:13,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:19:13,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658767885] [2025-02-06 10:19:13,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:13,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:19:13,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:13,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:19:13,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:19:13,964 INFO L87 Difference]: Start difference. First operand 353 states and 449 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 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-02-06 10:19:14,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:14,087 INFO L93 Difference]: Finished difference Result 361 states and 460 transitions. [2025-02-06 10:19:14,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:19:14,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 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) Word has length 42 [2025-02-06 10:19:14,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:14,089 INFO L225 Difference]: With dead ends: 361 [2025-02-06 10:19:14,089 INFO L226 Difference]: Without dead ends: 361 [2025-02-06 10:19:14,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:19:14,089 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 2 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:14,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 322 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:19:14,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-02-06 10:19:14,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 358. [2025-02-06 10:19:14,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 330 states have (on average 1.378787878787879) internal successors, (455), 357 states have internal predecessors, (455), 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-02-06 10:19:14,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 455 transitions. [2025-02-06 10:19:14,098 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 455 transitions. Word has length 42 [2025-02-06 10:19:14,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:14,098 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 455 transitions. [2025-02-06 10:19:14,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 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-02-06 10:19:14,099 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 455 transitions. [2025-02-06 10:19:14,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:19:14,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:14,099 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:14,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 10:19:14,099 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:14,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:14,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1206511083, now seen corresponding path program 1 times [2025-02-06 10:19:14,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:14,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692869026] [2025-02-06 10:19:14,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:14,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:14,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:19:14,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:19:14,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:14,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:14,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:14,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:14,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692869026] [2025-02-06 10:19:14,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692869026] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:19:14,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317241391] [2025-02-06 10:19:14,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:14,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:14,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:19:14,434 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:19:14,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 10:19:14,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:19:14,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:19:14,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:14,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:14,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-06 10:19:14,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:19:14,647 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:19:14,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:19:14,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:19:14,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 10:19:14,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-06 10:19:14,785 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-02-06 10:19:14,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2025-02-06 10:19:14,856 INFO L349 Elim1Store]: treesize reduction 22, result has 31.3 percent of original size [2025-02-06 10:19:14,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 36 [2025-02-06 10:19:14,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 10:19:14,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:14,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:19:15,026 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2025-02-06 10:19:15,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-02-06 10:19:15,030 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_639 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_639) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) |c_ULTIMATE.start_main_#t~mem16#1.base|)) is different from false [2025-02-06 10:19:15,141 INFO L349 Elim1Store]: treesize reduction 15, result has 70.0 percent of original size [2025-02-06 10:19:15,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 86 [2025-02-06 10:19:15,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:15,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 326 treesize of output 321 [2025-02-06 10:19:15,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 134 [2025-02-06 10:19:15,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-06 10:19:15,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:15,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 78 treesize of output 96 [2025-02-06 10:19:15,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:15,730 INFO L378 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 43 treesize of output 83 [2025-02-06 10:19:15,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:15,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317241391] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:19:15,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:19:15,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 28 [2025-02-06 10:19:15,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591866985] [2025-02-06 10:19:15,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:19:15,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-06 10:19:15,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:15,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-06 10:19:15,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=627, Unknown=12, NotChecked=52, Total=812 [2025-02-06 10:19:15,754 INFO L87 Difference]: Start difference. First operand 358 states and 455 transitions. Second operand has 29 states, 28 states have (on average 3.4642857142857144) internal successors, (97), 29 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-02-06 10:19:17,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:17,038 INFO L93 Difference]: Finished difference Result 693 states and 878 transitions. [2025-02-06 10:19:17,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 10:19:17,038 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.4642857142857144) internal successors, (97), 29 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 42 [2025-02-06 10:19:17,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:17,040 INFO L225 Difference]: With dead ends: 693 [2025-02-06 10:19:17,040 INFO L226 Difference]: Without dead ends: 693 [2025-02-06 10:19:17,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=399, Invalid=1395, Unknown=16, NotChecked=82, Total=1892 [2025-02-06 10:19:17,041 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 868 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 1882 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 2330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 369 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:17,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 1331 Invalid, 2330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1882 Invalid, 0 Unknown, 369 Unchecked, 0.9s Time] [2025-02-06 10:19:17,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-02-06 10:19:17,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 473. [2025-02-06 10:19:17,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 445 states have (on average 1.3752808988764045) internal successors, (612), 472 states have internal predecessors, (612), 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-02-06 10:19:17,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 612 transitions. [2025-02-06 10:19:17,048 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 612 transitions. Word has length 42 [2025-02-06 10:19:17,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:17,048 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 612 transitions. [2025-02-06 10:19:17,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.4642857142857144) internal successors, (97), 29 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-02-06 10:19:17,048 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 612 transitions. [2025-02-06 10:19:17,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:19:17,048 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:17,049 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:17,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 10:19:17,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-06 10:19:17,250 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:17,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:17,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1206511082, now seen corresponding path program 1 times [2025-02-06 10:19:17,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:17,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685638015] [2025-02-06 10:19:17,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:17,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:17,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:19:17,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:19:17,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:17,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:17,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:17,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:17,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685638015] [2025-02-06 10:19:17,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685638015] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:19:17,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052013105] [2025-02-06 10:19:17,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:17,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:17,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:19:17,593 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:19:17,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 10:19:17,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:19:17,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:19:17,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:17,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:17,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-06 10:19:17,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:19:17,714 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:19:17,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:19:17,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 10:19:17,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:19:17,807 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:19:17,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-06 10:19:17,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-06 10:19:17,865 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:19:17,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-06 10:19:17,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-06 10:19:18,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 10:19:18,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-06 10:19:18,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:18,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:19:18,210 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_713 (Array Int Int)) (v_ArrVal_714 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_714) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_713) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))) (forall ((v_ArrVal_714 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_714) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))) is different from false [2025-02-06 10:19:18,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:18,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 74 [2025-02-06 10:19:18,339 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_prenex_4) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_prenex_3) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_prenex_5) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem15#1.offset| 1))) (forall ((v_ArrVal_713 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_prenex_3))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_713)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) |c_ULTIMATE.start_main_#t~mem15#1.base|)) (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_712 (Array Int Int)) (v_ArrVal_714 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_712) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_711) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_714) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))) is different from false [2025-02-06 10:19:18,357 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (and (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_712 (Array Int Int)) (v_ArrVal_714 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_712) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_711) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_714) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_4) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_3) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_prenex_5) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) 1))) (forall ((v_ArrVal_713 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_3))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_713)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) .cse0)))) is different from false [2025-02-06 10:19:18,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:18,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2025-02-06 10:19:18,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:18,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2025-02-06 10:19:18,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2025-02-06 10:19:18,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:18,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 161 [2025-02-06 10:19:18,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2025-02-06 10:19:18,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2025-02-06 10:19:18,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2025-02-06 10:19:18,440 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 10:19:18,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 1 [2025-02-06 10:19:18,445 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 10:19:18,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 1 [2025-02-06 10:19:18,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:18,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 46 [2025-02-06 10:19:18,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:18,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052013105] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:19:18,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:19:18,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2025-02-06 10:19:18,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212785578] [2025-02-06 10:19:18,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:19:18,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-06 10:19:18,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:18,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-06 10:19:18,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=690, Unknown=9, NotChecked=168, Total=992 [2025-02-06 10:19:18,563 INFO L87 Difference]: Start difference. First operand 473 states and 612 transitions. Second operand has 32 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 32 states have internal predecessors, (105), 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-02-06 10:19:19,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:19,455 INFO L93 Difference]: Finished difference Result 622 states and 788 transitions. [2025-02-06 10:19:19,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 10:19:19,455 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 32 states have internal predecessors, (105), 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 42 [2025-02-06 10:19:19,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:19,464 INFO L225 Difference]: With dead ends: 622 [2025-02-06 10:19:19,464 INFO L226 Difference]: Without dead ends: 622 [2025-02-06 10:19:19,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=275, Invalid=1288, Unknown=9, NotChecked=234, Total=1806 [2025-02-06 10:19:19,465 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 538 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 2277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 941 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:19,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 1083 Invalid, 2277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1283 Invalid, 0 Unknown, 941 Unchecked, 0.6s Time] [2025-02-06 10:19:19,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2025-02-06 10:19:19,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 482. [2025-02-06 10:19:19,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 460 states have (on average 1.373913043478261) internal successors, (632), 481 states have internal predecessors, (632), 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-02-06 10:19:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 632 transitions. [2025-02-06 10:19:19,480 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 632 transitions. Word has length 42 [2025-02-06 10:19:19,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:19,480 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 632 transitions. [2025-02-06 10:19:19,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 32 states have internal predecessors, (105), 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-02-06 10:19:19,481 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 632 transitions. [2025-02-06 10:19:19,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:19:19,481 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:19,481 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:19,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 10:19:19,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-06 10:19:19,682 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:19,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:19,683 INFO L85 PathProgramCache]: Analyzing trace with hash -562151019, now seen corresponding path program 1 times [2025-02-06 10:19:19,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:19,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724553890] [2025-02-06 10:19:19,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:19,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:19,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:19:19,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:19:19,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:19,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:20,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:20,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:20,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724553890] [2025-02-06 10:19:20,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724553890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:20,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:20,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 10:19:20,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007462258] [2025-02-06 10:19:20,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:20,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 10:19:20,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:20,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 10:19:20,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:19:20,169 INFO L87 Difference]: Start difference. First operand 482 states and 632 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 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-02-06 10:19:20,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:20,500 INFO L93 Difference]: Finished difference Result 613 states and 789 transitions. [2025-02-06 10:19:20,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 10:19:20,501 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 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) Word has length 42 [2025-02-06 10:19:20,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:20,503 INFO L225 Difference]: With dead ends: 613 [2025-02-06 10:19:20,503 INFO L226 Difference]: Without dead ends: 613 [2025-02-06 10:19:20,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2025-02-06 10:19:20,506 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 140 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:20,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 702 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:19:20,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-02-06 10:19:20,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 553. [2025-02-06 10:19:20,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 531 states have (on average 1.384180790960452) internal successors, (735), 552 states have internal predecessors, (735), 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-02-06 10:19:20,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 735 transitions. [2025-02-06 10:19:20,520 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 735 transitions. Word has length 42 [2025-02-06 10:19:20,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:20,520 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 735 transitions. [2025-02-06 10:19:20,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 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-02-06 10:19:20,520 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 735 transitions. [2025-02-06 10:19:20,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 10:19:20,520 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:20,520 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:20,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 10:19:20,521 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:20,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:20,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1053847116, now seen corresponding path program 1 times [2025-02-06 10:19:20,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:20,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18368207] [2025-02-06 10:19:20,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:20,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:20,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 10:19:20,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 10:19:20,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:20,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:20,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:20,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:20,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18368207] [2025-02-06 10:19:20,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18368207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:20,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:20,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 10:19:20,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424438473] [2025-02-06 10:19:20,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:20,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 10:19:20,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:20,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 10:19:20,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:19:20,742 INFO L87 Difference]: Start difference. First operand 553 states and 735 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 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-02-06 10:19:21,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:21,211 INFO L93 Difference]: Finished difference Result 740 states and 945 transitions. [2025-02-06 10:19:21,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 10:19:21,211 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 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) Word has length 44 [2025-02-06 10:19:21,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:21,213 INFO L225 Difference]: With dead ends: 740 [2025-02-06 10:19:21,213 INFO L226 Difference]: Without dead ends: 722 [2025-02-06 10:19:21,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2025-02-06 10:19:21,215 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 264 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:21,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 782 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:19:21,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2025-02-06 10:19:21,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 501. [2025-02-06 10:19:21,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 479 states have (on average 1.3799582463465554) internal successors, (661), 500 states have internal predecessors, (661), 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-02-06 10:19:21,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 661 transitions. [2025-02-06 10:19:21,224 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 661 transitions. Word has length 44 [2025-02-06 10:19:21,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:21,224 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 661 transitions. [2025-02-06 10:19:21,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 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-02-06 10:19:21,225 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 661 transitions. [2025-02-06 10:19:21,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 10:19:21,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:21,226 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:21,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 10:19:21,226 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:21,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:21,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1808577996, now seen corresponding path program 1 times [2025-02-06 10:19:21,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:21,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097590573] [2025-02-06 10:19:21,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:21,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:21,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 10:19:21,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 10:19:21,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:21,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:21,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:21,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:21,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097590573] [2025-02-06 10:19:21,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097590573] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:21,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:21,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 10:19:21,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306983511] [2025-02-06 10:19:21,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:21,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 10:19:21,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:21,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 10:19:21,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:19:21,446 INFO L87 Difference]: Start difference. First operand 501 states and 661 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 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-02-06 10:19:21,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:21,808 INFO L93 Difference]: Finished difference Result 699 states and 896 transitions. [2025-02-06 10:19:21,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 10:19:21,808 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 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) Word has length 44 [2025-02-06 10:19:21,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:21,810 INFO L225 Difference]: With dead ends: 699 [2025-02-06 10:19:21,810 INFO L226 Difference]: Without dead ends: 699 [2025-02-06 10:19:21,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2025-02-06 10:19:21,810 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 235 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:21,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 794 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:19:21,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-02-06 10:19:21,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 566. [2025-02-06 10:19:21,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 544 states have (on average 1.3621323529411764) internal successors, (741), 565 states have internal predecessors, (741), 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-02-06 10:19:21,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 741 transitions. [2025-02-06 10:19:21,818 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 741 transitions. Word has length 44 [2025-02-06 10:19:21,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:21,818 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 741 transitions. [2025-02-06 10:19:21,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 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-02-06 10:19:21,818 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 741 transitions. [2025-02-06 10:19:21,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 10:19:21,819 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:21,819 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:21,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 10:19:21,819 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:21,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:21,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1232461542, now seen corresponding path program 1 times [2025-02-06 10:19:21,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:21,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130224942] [2025-02-06 10:19:21,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:21,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:21,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 10:19:21,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 10:19:21,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:21,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:22,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:22,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:22,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130224942] [2025-02-06 10:19:22,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130224942] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:19:22,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794205086] [2025-02-06 10:19:22,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:22,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:22,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:19:22,458 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:19:22,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 10:19:22,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 10:19:22,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 10:19:22,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:22,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:22,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 10:19:22,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:19:22,642 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:19:22,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:19:22,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 10:19:22,723 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:19:22,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2025-02-06 10:19:22,756 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:19:22,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 10:19:22,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 10:19:22,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:22,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:19:22,905 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-02-06 10:19:22,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2025-02-06 10:19:22,910 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_890 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_890) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4)) |c_ULTIMATE.start_main_#t~mem22#1.base|)) is different from false [2025-02-06 10:19:22,962 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_889 (Array Int Int)) (v_ArrVal_890 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_889))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)))) (= (select (select (store .cse0 .cse1 v_ArrVal_890) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4)) .cse1)))) is different from false [2025-02-06 10:19:22,966 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_889 (Array Int Int)) (v_ArrVal_890 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_889))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_890) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))))))) is different from false [2025-02-06 10:19:22,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:22,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 44 [2025-02-06 10:19:22,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:22,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 326 treesize of output 229 [2025-02-06 10:19:22,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:22,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 63 [2025-02-06 10:19:22,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2025-02-06 10:19:23,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:23,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 46 [2025-02-06 10:19:23,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:23,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794205086] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:19:23,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:19:23,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 12] total 34 [2025-02-06 10:19:23,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714331211] [2025-02-06 10:19:23,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:19:23,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-06 10:19:23,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:23,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-06 10:19:23,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=887, Unknown=8, NotChecked=186, Total=1190 [2025-02-06 10:19:23,154 INFO L87 Difference]: Start difference. First operand 566 states and 741 transitions. Second operand has 35 states, 34 states have (on average 3.4705882352941178) internal successors, (118), 35 states have internal predecessors, (118), 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-02-06 10:19:25,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:25,327 INFO L93 Difference]: Finished difference Result 1151 states and 1444 transitions. [2025-02-06 10:19:25,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-02-06 10:19:25,327 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.4705882352941178) internal successors, (118), 35 states have internal predecessors, (118), 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 44 [2025-02-06 10:19:25,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:25,330 INFO L225 Difference]: With dead ends: 1151 [2025-02-06 10:19:25,330 INFO L226 Difference]: Without dead ends: 1151 [2025-02-06 10:19:25,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1445 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=871, Invalid=4389, Unknown=8, NotChecked=432, Total=5700 [2025-02-06 10:19:25,331 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 1758 mSDsluCounter, 1839 mSDsCounter, 0 mSdLazyCounter, 2462 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1758 SdHoareTripleChecker+Valid, 1931 SdHoareTripleChecker+Invalid, 4713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 2462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2013 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:25,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1758 Valid, 1931 Invalid, 4713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 2462 Invalid, 0 Unknown, 2013 Unchecked, 1.2s Time] [2025-02-06 10:19:25,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2025-02-06 10:19:25,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 578. [2025-02-06 10:19:25,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 556 states have (on average 1.3615107913669064) internal successors, (757), 577 states have internal predecessors, (757), 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-02-06 10:19:25,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 757 transitions. [2025-02-06 10:19:25,338 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 757 transitions. Word has length 44 [2025-02-06 10:19:25,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:25,338 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 757 transitions. [2025-02-06 10:19:25,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.4705882352941178) internal successors, (118), 35 states have internal predecessors, (118), 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-02-06 10:19:25,338 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 757 transitions. [2025-02-06 10:19:25,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 10:19:25,339 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:25,339 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:25,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 10:19:25,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-02-06 10:19:25,540 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:25,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:25,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1232461541, now seen corresponding path program 1 times [2025-02-06 10:19:25,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:25,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971293800] [2025-02-06 10:19:25,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:25,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:25,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 10:19:25,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 10:19:25,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:25,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:26,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:26,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:26,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971293800] [2025-02-06 10:19:26,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971293800] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:19:26,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157639214] [2025-02-06 10:19:26,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:26,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:26,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:19:26,182 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:19:26,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 10:19:26,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 10:19:26,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 10:19:26,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:26,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:26,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-06 10:19:26,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:19:26,389 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:19:26,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:19:26,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2025-02-06 10:19:26,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 10:19:26,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:19:26,505 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:19:26,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 10:19:26,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 10:19:26,557 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:19:26,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 10:19:26,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 10:19:26,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 10:19:26,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 10:19:26,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:26,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:19:26,859 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) (and (forall ((v_ArrVal_966 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_966) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0))) (forall ((v_ArrVal_966 (Array Int Int)) (v_ArrVal_967 (Array Int Int))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_966) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_967) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0)))))) is different from false [2025-02-06 10:19:26,865 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) (and (forall ((v_ArrVal_966 (Array Int Int)) (v_ArrVal_967 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_966) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_967) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1)))) (forall ((v_ArrVal_966 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_966) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1))))) is different from false [2025-02-06 10:19:26,885 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) (and (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_966 (Array Int Int)) (v_ArrVal_965 (Array Int Int)) (v_ArrVal_967 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_964))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse3))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_965) .cse0 v_ArrVal_966) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_967) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1)))))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_966 (Array Int Int)) (v_ArrVal_965 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_965) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_964) |c_ULTIMATE.start_main_~n~0#1.base|) .cse3) v_ArrVal_966) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1))))) is different from false [2025-02-06 10:19:26,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:26,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 45 [2025-02-06 10:19:26,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:26,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2025-02-06 10:19:27,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2025-02-06 10:19:27,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:27,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 115 [2025-02-06 10:19:27,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2025-02-06 10:19:27,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 72 [2025-02-06 10:19:27,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2025-02-06 10:19:27,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:27,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2025-02-06 10:19:27,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:27,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2025-02-06 10:19:27,076 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:19:27,077 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:19:27,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:19:27,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 56 [2025-02-06 10:19:27,084 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:19:27,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:19:27,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-02-06 10:19:27,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:27,226 INFO L378 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 34 treesize of output 74 [2025-02-06 10:19:27,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:27,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157639214] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:19:27,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:19:27,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 12] total 39 [2025-02-06 10:19:27,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686098355] [2025-02-06 10:19:27,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:19:27,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-02-06 10:19:27,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:27,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-06 10:19:27,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1187, Unknown=23, NotChecked=216, Total=1560 [2025-02-06 10:19:27,249 INFO L87 Difference]: Start difference. First operand 578 states and 757 transitions. Second operand has 40 states, 39 states have (on average 3.1794871794871793) internal successors, (124), 40 states have internal predecessors, (124), 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-02-06 10:19:30,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:30,867 INFO L93 Difference]: Finished difference Result 1597 states and 2003 transitions. [2025-02-06 10:19:30,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-02-06 10:19:30,868 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 3.1794871794871793) internal successors, (124), 40 states have internal predecessors, (124), 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 44 [2025-02-06 10:19:30,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:30,871 INFO L225 Difference]: With dead ends: 1597 [2025-02-06 10:19:30,871 INFO L226 Difference]: Without dead ends: 1597 [2025-02-06 10:19:30,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2704 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1459, Invalid=7820, Unknown=45, NotChecked=576, Total=9900 [2025-02-06 10:19:30,875 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 3027 mSDsluCounter, 2459 mSDsCounter, 0 mSdLazyCounter, 3203 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3027 SdHoareTripleChecker+Valid, 2583 SdHoareTripleChecker+Invalid, 6513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 3203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2935 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:30,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3027 Valid, 2583 Invalid, 6513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 3203 Invalid, 0 Unknown, 2935 Unchecked, 1.7s Time] [2025-02-06 10:19:30,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2025-02-06 10:19:30,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1021. [2025-02-06 10:19:30,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 999 states have (on average 1.3633633633633633) internal successors, (1362), 1020 states have internal predecessors, (1362), 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-02-06 10:19:30,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1362 transitions. [2025-02-06 10:19:30,893 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1362 transitions. Word has length 44 [2025-02-06 10:19:30,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:30,893 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1362 transitions. [2025-02-06 10:19:30,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.1794871794871793) internal successors, (124), 40 states have internal predecessors, (124), 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-02-06 10:19:30,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1362 transitions. [2025-02-06 10:19:30,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 10:19:30,894 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:30,894 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:30,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 10:19:31,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:31,098 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:31,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:31,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1237232907, now seen corresponding path program 1 times [2025-02-06 10:19:31,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:31,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057123183] [2025-02-06 10:19:31,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:31,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:31,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 10:19:31,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 10:19:31,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:31,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:31,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:19:31,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:31,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057123183] [2025-02-06 10:19:31,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057123183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:19:31,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:19:31,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:19:31,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183269268] [2025-02-06 10:19:31,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:19:31,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:19:31,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:31,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:19:31,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:19:31,170 INFO L87 Difference]: Start difference. First operand 1021 states and 1362 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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-02-06 10:19:31,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:31,302 INFO L93 Difference]: Finished difference Result 1021 states and 1346 transitions. [2025-02-06 10:19:31,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:19:31,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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 44 [2025-02-06 10:19:31,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:31,304 INFO L225 Difference]: With dead ends: 1021 [2025-02-06 10:19:31,304 INFO L226 Difference]: Without dead ends: 1021 [2025-02-06 10:19:31,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:19:31,304 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 15 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:31,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 275 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:19:31,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2025-02-06 10:19:31,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1021. [2025-02-06 10:19:31,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 999 states have (on average 1.3473473473473474) internal successors, (1346), 1020 states have internal predecessors, (1346), 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-02-06 10:19:31,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1346 transitions. [2025-02-06 10:19:31,314 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1346 transitions. Word has length 44 [2025-02-06 10:19:31,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:31,314 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1346 transitions. [2025-02-06 10:19:31,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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-02-06 10:19:31,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1346 transitions. [2025-02-06 10:19:31,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 10:19:31,315 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:31,315 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:31,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-06 10:19:31,315 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:31,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:31,315 INFO L85 PathProgramCache]: Analyzing trace with hash 115221403, now seen corresponding path program 1 times [2025-02-06 10:19:31,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:31,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644549212] [2025-02-06 10:19:31,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:31,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:31,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 10:19:31,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 10:19:31,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:31,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:32,256 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:32,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:32,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644549212] [2025-02-06 10:19:32,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644549212] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:19:32,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716329410] [2025-02-06 10:19:32,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:32,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:32,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:19:32,259 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:19:32,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 10:19:32,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 10:19:32,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 10:19:32,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:32,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:32,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-06 10:19:32,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:19:32,454 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:19:32,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:19:32,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 10:19:32,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 10:19:32,546 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:19:32,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2025-02-06 10:19:32,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 10:19:32,591 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:19:32,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2025-02-06 10:19:32,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2025-02-06 10:19:32,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2025-02-06 10:19:32,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2025-02-06 10:19:32,724 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:32,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:19:32,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:32,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2025-02-06 10:19:32,871 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) (and (forall ((v_ArrVal_1117 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1117) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0) (+ 5 |c_ULTIMATE.start_main_#t~mem22#1.offset|))) (forall ((v_prenex_9 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0))) (forall ((v_ArrVal_1116 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1116) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0) |c_ULTIMATE.start_main_#t~mem22#1.base|)))) is different from false [2025-02-06 10:19:32,883 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) (and (forall ((v_prenex_9 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1))) (forall ((v_ArrVal_1116 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1116) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1) .cse0)) (forall ((v_ArrVal_1117 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1117) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1) (+ 5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse2))))))) is different from false [2025-02-06 10:19:32,897 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) (and (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1114 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1114))) (< (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1115) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1117) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) (+ 5 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1115))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (= .cse3 (select (select (store .cse4 .cse3 v_ArrVal_1116) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1114 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1114) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1115) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))))) is different from false [2025-02-06 10:19:32,905 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (and (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1114 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1114) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1115) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))) (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1114 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1114))) (< (select (select (store .cse3 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1115) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1117) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) (+ 5 (select (select .cse3 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1115))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (= (select (select (store .cse4 .cse5 v_ArrVal_1116) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) .cse5))))))) is different from false [2025-02-06 10:19:32,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:32,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 154 [2025-02-06 10:19:32,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:32,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 104 [2025-02-06 10:19:32,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:32,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 396 treesize of output 329 [2025-02-06 10:19:32,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:32,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 573 treesize of output 506 [2025-02-06 10:19:32,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 361 treesize of output 349 [2025-02-06 10:19:32,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 349 treesize of output 333 [2025-02-06 10:19:32,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:32,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 333 treesize of output 322 [2025-02-06 10:19:32,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 313 treesize of output 301 [2025-02-06 10:19:32,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 301 treesize of output 285 [2025-02-06 10:19:32,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 285 treesize of output 273 [2025-02-06 10:19:33,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:33,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 273 treesize of output 246 [2025-02-06 10:19:33,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 237 treesize of output 233 [2025-02-06 10:19:33,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:33,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 46 [2025-02-06 10:19:33,271 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:33,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716329410] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:19:33,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:19:33,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 12] total 41 [2025-02-06 10:19:33,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488070660] [2025-02-06 10:19:33,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:19:33,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-06 10:19:33,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:33,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-06 10:19:33,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1214, Unknown=4, NotChecked=300, Total=1722 [2025-02-06 10:19:33,276 INFO L87 Difference]: Start difference. First operand 1021 states and 1346 transitions. Second operand has 42 states, 41 states have (on average 3.1951219512195124) internal successors, (131), 42 states have internal predecessors, (131), 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-02-06 10:19:37,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:37,259 INFO L93 Difference]: Finished difference Result 3745 states and 4789 transitions. [2025-02-06 10:19:37,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2025-02-06 10:19:37,259 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.1951219512195124) internal successors, (131), 42 states have internal predecessors, (131), 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 49 [2025-02-06 10:19:37,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:37,266 INFO L225 Difference]: With dead ends: 3745 [2025-02-06 10:19:37,266 INFO L226 Difference]: Without dead ends: 3745 [2025-02-06 10:19:37,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 98 SyntacticMatches, 7 SemanticMatches, 123 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 5296 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2837, Invalid=11695, Unknown=4, NotChecked=964, Total=15500 [2025-02-06 10:19:37,269 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1540 mSDsluCounter, 2863 mSDsCounter, 0 mSdLazyCounter, 3281 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1540 SdHoareTripleChecker+Valid, 3015 SdHoareTripleChecker+Invalid, 7265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 3281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3820 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:37,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1540 Valid, 3015 Invalid, 7265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 3281 Invalid, 0 Unknown, 3820 Unchecked, 1.6s Time] [2025-02-06 10:19:37,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3745 states. [2025-02-06 10:19:37,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3745 to 1925. [2025-02-06 10:19:37,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1905 states have (on average 1.3328083989501311) internal successors, (2539), 1924 states have internal predecessors, (2539), 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-02-06 10:19:37,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2539 transitions. [2025-02-06 10:19:37,297 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2539 transitions. Word has length 49 [2025-02-06 10:19:37,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:37,297 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2539 transitions. [2025-02-06 10:19:37,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.1951219512195124) internal successors, (131), 42 states have internal predecessors, (131), 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-02-06 10:19:37,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2539 transitions. [2025-02-06 10:19:37,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 10:19:37,298 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:37,298 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:37,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 10:19:37,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:37,500 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:19:37,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:37,501 INFO L85 PathProgramCache]: Analyzing trace with hash 110450037, now seen corresponding path program 1 times [2025-02-06 10:19:37,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:37,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721233181] [2025-02-06 10:19:37,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:37,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:37,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 10:19:37,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 10:19:37,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:37,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:37,937 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:37,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:37,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721233181] [2025-02-06 10:19:37,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721233181] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:19:37,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129404052] [2025-02-06 10:19:37,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:37,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:37,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:19:37,940 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:19:37,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 10:19:38,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 10:19:38,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 10:19:38,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:38,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:38,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-06 10:19:38,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:19:38,121 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:19:38,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:19:38,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 10:19:38,220 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:19:38,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-02-06 10:19:38,318 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:19:38,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-02-06 10:19:38,411 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2025-02-06 10:19:38,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2025-02-06 10:19:38,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:19:38,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2025-02-06 10:19:38,624 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:19:38,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 55 [2025-02-06 10:19:38,704 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:19:38,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 55 [2025-02-06 10:19:38,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:38,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 21 [2025-02-06 10:19:38,964 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:38,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:19:39,021 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1234 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_1234) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) is different from false [2025-02-06 10:19:39,034 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1233 (Array Int Int))) (= 1 (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1233))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_1234)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))) is different from false [2025-02-06 10:19:39,091 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1234 (Array Int Int)) (v_ArrVal_1233 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~malloc20#1.base|)) |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_1233))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1234))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) is different from false [2025-02-06 10:19:39,431 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:19:39,456 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-02-06 10:19:39,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 7259 treesize of output 6221 [2025-02-06 10:19:39,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:39,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1498 treesize of output 1420 [2025-02-06 10:19:39,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:39,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1006 treesize of output 954 [2025-02-06 10:19:39,879 INFO L349 Elim1Store]: treesize reduction 141, result has 73.9 percent of original size [2025-02-06 10:19:39,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 10 new quantified variables, introduced 54 case distinctions, treesize of input 1452 treesize of output 1679 [2025-02-06 10:19:39,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1167 treesize of output 1109 [2025-02-06 10:19:40,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 444 treesize of output 396 [2025-02-06 10:19:40,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4