./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext/tree_cnstr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba983053090b7e7410066c63fe0cfe9ad27960a7dc19d54045684ba21359c88d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:57:25,689 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:57:25,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 11:57:25,754 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:57:25,755 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:57:25,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:57:25,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:57:25,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:57:25,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:57:25,780 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:57:25,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:57:25,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:57:25,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:57:25,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:57:25,781 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:57:25,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:57:25,781 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:57:25,782 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:57:25,782 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:57:25,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:57:25,782 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:57:25,782 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:57:25,782 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 11:57:25,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:57:25,782 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:57:25,782 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:57:25,782 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:57:25,782 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:57:25,782 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:57:25,782 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:57:25,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:57:25,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:57:25,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:57:25,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:57:25,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:57:25,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:57:25,782 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:57:25,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:57:25,782 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:57:25,782 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:57:25,783 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:57:25,783 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:57:25,783 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ba983053090b7e7410066c63fe0cfe9ad27960a7dc19d54045684ba21359c88d [2025-03-17 11:57:26,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:57:26,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:57:26,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:57:26,021 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:57:26,022 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:57:26,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2025-03-17 11:57:27,164 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/001f22269/e58383d7d8574e73b9ba9dec1d1d5b8f/FLAG55a95afd1 [2025-03-17 11:57:27,432 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:57:27,432 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2025-03-17 11:57:27,440 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/001f22269/e58383d7d8574e73b9ba9dec1d1d5b8f/FLAG55a95afd1 [2025-03-17 11:57:27,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/001f22269/e58383d7d8574e73b9ba9dec1d1d5b8f [2025-03-17 11:57:27,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:57:27,727 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:57:27,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:57:27,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:57:27,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:57:27,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:57:27" (1/1) ... [2025-03-17 11:57:27,732 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67cb8559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:27, skipping insertion in model container [2025-03-17 11:57:27,732 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:57:27" (1/1) ... [2025-03-17 11:57:27,754 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:57:27,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:57:27,972 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:57:28,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:57:28,030 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:57:28,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:28 WrapperNode [2025-03-17 11:57:28,031 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:57:28,031 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:57:28,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:57:28,032 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:57:28,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:28" (1/1) ... [2025-03-17 11:57:28,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:28" (1/1) ... [2025-03-17 11:57:28,062 INFO L138 Inliner]: procedures = 123, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 131 [2025-03-17 11:57:28,063 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:57:28,064 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:57:28,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:57:28,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:57:28,069 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:28" (1/1) ... [2025-03-17 11:57:28,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:28" (1/1) ... [2025-03-17 11:57:28,071 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:28" (1/1) ... [2025-03-17 11:57:28,082 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-03-17 11:57:28,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:28" (1/1) ... [2025-03-17 11:57:28,083 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:28" (1/1) ... [2025-03-17 11:57:28,087 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:28" (1/1) ... [2025-03-17 11:57:28,088 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:28" (1/1) ... [2025-03-17 11:57:28,089 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:28" (1/1) ... [2025-03-17 11:57:28,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:28" (1/1) ... [2025-03-17 11:57:28,091 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:57:28,091 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:57:28,091 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:57:28,091 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:57:28,092 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:28" (1/1) ... [2025-03-17 11:57:28,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:57:28,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:57:28,119 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:57:28,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:57:28,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:57:28,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:57:28,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 11:57:28,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 11:57:28,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 11:57:28,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 11:57:28,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:57:28,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 11:57:28,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 11:57:28,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:57:28,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:57:28,210 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:57:28,211 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:57:28,478 INFO L? ?]: Removed 143 outVars from TransFormulas that were not future-live. [2025-03-17 11:57:28,478 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:57:28,490 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:57:28,490 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:57:28,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:57:28 BoogieIcfgContainer [2025-03-17 11:57:28,491 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:57:28,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:57:28,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:57:28,496 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:57:28,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:57:27" (1/3) ... [2025-03-17 11:57:28,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b8675e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:57:28, skipping insertion in model container [2025-03-17 11:57:28,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:57:28" (2/3) ... [2025-03-17 11:57:28,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b8675e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:57:28, skipping insertion in model container [2025-03-17 11:57:28,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:57:28" (3/3) ... [2025-03-17 11:57:28,500 INFO L128 eAbstractionObserver]: Analyzing ICFG tree_cnstr.i [2025-03-17 11:57:28,512 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:57:28,513 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tree_cnstr.i that has 1 procedures, 121 locations, 1 initial locations, 4 loop locations, and 56 error locations. [2025-03-17 11:57:28,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:57:28,555 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;@4baa0d7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:57:28,555 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2025-03-17 11:57:28,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 64 states have (on average 2.140625) internal successors, (137), 120 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:28,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 11:57:28,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:28,563 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 11:57:28,563 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-03-17 11:57:28,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:28,568 INFO L85 PathProgramCache]: Analyzing trace with hash 5471, now seen corresponding path program 1 times [2025-03-17 11:57:28,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:28,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891891255] [2025-03-17 11:57:28,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:28,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:28,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 11:57:28,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 11:57:28,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:28,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:28,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:28,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:28,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891891255] [2025-03-17 11:57:28,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891891255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:28,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:28,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:57:28,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404036262] [2025-03-17 11:57:28,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:28,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:57:28,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:28,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:57:28,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:28,750 INFO L87 Difference]: Start difference. First operand has 121 states, 64 states have (on average 2.140625) internal successors, (137), 120 states have internal predecessors, (137), 0 states have call successors, (0), 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.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:28,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:28,862 INFO L93 Difference]: Finished difference Result 159 states and 178 transitions. [2025-03-17 11:57:28,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:57:28,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-03-17 11:57:28,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:28,869 INFO L225 Difference]: With dead ends: 159 [2025-03-17 11:57:28,869 INFO L226 Difference]: Without dead ends: 157 [2025-03-17 11:57:28,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:28,872 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 121 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:28,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 105 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:57:28,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-17 11:57:28,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 117. [2025-03-17 11:57:28,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 63 states have (on average 2.0634920634920637) internal successors, (130), 116 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:28,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2025-03-17 11:57:28,929 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 2 [2025-03-17 11:57:28,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:28,930 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2025-03-17 11:57:28,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:28,931 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2025-03-17 11:57:28,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 11:57:28,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:28,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 11:57:28,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:57:28,932 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-03-17 11:57:28,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:28,933 INFO L85 PathProgramCache]: Analyzing trace with hash 5472, now seen corresponding path program 1 times [2025-03-17 11:57:28,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:28,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551409667] [2025-03-17 11:57:28,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:28,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:28,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 11:57:28,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 11:57:28,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:28,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:29,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:29,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:29,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551409667] [2025-03-17 11:57:29,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551409667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:29,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:29,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:57:29,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619997312] [2025-03-17 11:57:29,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:29,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:57:29,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:29,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:57:29,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:29,007 INFO L87 Difference]: Start difference. First operand 117 states and 130 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:29,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:29,108 INFO L93 Difference]: Finished difference Result 155 states and 174 transitions. [2025-03-17 11:57:29,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:57:29,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-03-17 11:57:29,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:29,109 INFO L225 Difference]: With dead ends: 155 [2025-03-17 11:57:29,109 INFO L226 Difference]: Without dead ends: 155 [2025-03-17 11:57:29,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:29,110 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 122 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:29,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 107 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:57:29,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-17 11:57:29,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 115. [2025-03-17 11:57:29,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 63 states have (on average 2.0317460317460316) internal successors, (128), 114 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:29,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2025-03-17 11:57:29,115 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 2 [2025-03-17 11:57:29,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:29,115 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2025-03-17 11:57:29,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:29,115 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2025-03-17 11:57:29,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:57:29,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:29,116 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:57:29,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:57:29,116 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-03-17 11:57:29,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:29,116 INFO L85 PathProgramCache]: Analyzing trace with hash 760846390, now seen corresponding path program 1 times [2025-03-17 11:57:29,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:29,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940027653] [2025-03-17 11:57:29,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:29,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:29,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:57:29,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:57:29,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:29,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:29,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:29,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:29,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940027653] [2025-03-17 11:57:29,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940027653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:29,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:29,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:57:29,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969940005] [2025-03-17 11:57:29,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:29,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:57:29,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:29,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:57:29,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:57:29,179 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:29,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:29,319 INFO L93 Difference]: Finished difference Result 142 states and 164 transitions. [2025-03-17 11:57:29,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:57:29,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-03-17 11:57:29,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:29,320 INFO L225 Difference]: With dead ends: 142 [2025-03-17 11:57:29,320 INFO L226 Difference]: Without dead ends: 142 [2025-03-17 11:57:29,320 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-03-17 11:57:29,321 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 200 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:29,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 75 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:57:29,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-17 11:57:29,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 102. [2025-03-17 11:57:29,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.7878787878787878) internal successors, (118), 101 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-03-17 11:57:29,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2025-03-17 11:57:29,327 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 6 [2025-03-17 11:57:29,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:29,327 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2025-03-17 11:57:29,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:29,330 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2025-03-17 11:57:29,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:57:29,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:29,331 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:57:29,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:57:29,331 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-03-17 11:57:29,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:29,331 INFO L85 PathProgramCache]: Analyzing trace with hash 760846391, now seen corresponding path program 1 times [2025-03-17 11:57:29,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:29,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37448083] [2025-03-17 11:57:29,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:29,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:29,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:57:29,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:57:29,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:29,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:29,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:29,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:29,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37448083] [2025-03-17 11:57:29,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37448083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:29,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:29,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:57:29,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343910032] [2025-03-17 11:57:29,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:29,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:57:29,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:29,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:57:29,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:57:29,460 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:29,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:29,640 INFO L93 Difference]: Finished difference Result 202 states and 236 transitions. [2025-03-17 11:57:29,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:57:29,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-03-17 11:57:29,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:29,641 INFO L225 Difference]: With dead ends: 202 [2025-03-17 11:57:29,641 INFO L226 Difference]: Without dead ends: 202 [2025-03-17 11:57:29,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:57:29,642 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 239 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:29,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 126 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:57:29,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-17 11:57:29,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 170. [2025-03-17 11:57:29,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 134 states have (on average 1.708955223880597) internal successors, (229), 169 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:29,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 229 transitions. [2025-03-17 11:57:29,648 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 229 transitions. Word has length 6 [2025-03-17 11:57:29,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:29,649 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 229 transitions. [2025-03-17 11:57:29,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:29,649 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 229 transitions. [2025-03-17 11:57:29,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 11:57:29,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:29,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:29,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:57:29,650 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-03-17 11:57:29,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:29,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1028838667, now seen corresponding path program 1 times [2025-03-17 11:57:29,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:29,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537509609] [2025-03-17 11:57:29,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:29,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:29,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 11:57:29,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 11:57:29,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:29,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:29,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:29,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:29,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537509609] [2025-03-17 11:57:29,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537509609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:29,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:29,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:57:29,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350566651] [2025-03-17 11:57:29,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:29,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:57:29,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:29,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:57:29,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:29,672 INFO L87 Difference]: Start difference. First operand 170 states and 229 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:29,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:29,690 INFO L93 Difference]: Finished difference Result 184 states and 227 transitions. [2025-03-17 11:57:29,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:57:29,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 11:57:29,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:29,692 INFO L225 Difference]: With dead ends: 184 [2025-03-17 11:57:29,692 INFO L226 Difference]: Without dead ends: 184 [2025-03-17 11:57:29,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:29,692 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 103 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 152 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-03-17 11:57:29,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 152 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:57:29,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-17 11:57:29,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 170. [2025-03-17 11:57:29,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 134 states have (on average 1.6940298507462686) internal successors, (227), 169 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:29,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 227 transitions. [2025-03-17 11:57:29,708 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 227 transitions. Word has length 8 [2025-03-17 11:57:29,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:29,709 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 227 transitions. [2025-03-17 11:57:29,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:29,709 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 227 transitions. [2025-03-17 11:57:29,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 11:57:29,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:29,709 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:29,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:57:29,710 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-03-17 11:57:29,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:29,710 INFO L85 PathProgramCache]: Analyzing trace with hash 192087324, now seen corresponding path program 1 times [2025-03-17 11:57:29,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:29,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137727621] [2025-03-17 11:57:29,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:29,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:29,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 11:57:29,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 11:57:29,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:29,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:29,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:29,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:29,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137727621] [2025-03-17 11:57:29,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137727621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:29,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:29,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:57:29,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501037503] [2025-03-17 11:57:29,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:29,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:57:29,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:29,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:57:29,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:29,739 INFO L87 Difference]: Start difference. First operand 170 states and 227 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:29,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:29,746 INFO L93 Difference]: Finished difference Result 173 states and 230 transitions. [2025-03-17 11:57:29,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:57:29,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-17 11:57:29,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:29,747 INFO L225 Difference]: With dead ends: 173 [2025-03-17 11:57:29,747 INFO L226 Difference]: Without dead ends: 173 [2025-03-17 11:57:29,747 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-03-17 11:57:29,748 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 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-03-17 11:57:29,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:57:29,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-17 11:57:29,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-03-17 11:57:29,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 137 states have (on average 1.6788321167883211) internal successors, (230), 172 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:29,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 230 transitions. [2025-03-17 11:57:29,758 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 230 transitions. Word has length 13 [2025-03-17 11:57:29,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:29,758 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 230 transitions. [2025-03-17 11:57:29,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:29,758 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 230 transitions. [2025-03-17 11:57:29,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 11:57:29,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:29,758 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:29,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:57:29,758 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-03-17 11:57:29,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:29,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2027438223, now seen corresponding path program 1 times [2025-03-17 11:57:29,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:29,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320030194] [2025-03-17 11:57:29,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:29,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:29,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 11:57:29,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 11:57:29,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:29,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:29,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:29,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:29,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320030194] [2025-03-17 11:57:29,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320030194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:29,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:29,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:57:29,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639729739] [2025-03-17 11:57:29,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:29,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:57:29,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:29,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:57:29,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:29,794 INFO L87 Difference]: Start difference. First operand 173 states and 230 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:29,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:29,801 INFO L93 Difference]: Finished difference Result 175 states and 232 transitions. [2025-03-17 11:57:29,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:57:29,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-17 11:57:29,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:29,802 INFO L225 Difference]: With dead ends: 175 [2025-03-17 11:57:29,802 INFO L226 Difference]: Without dead ends: 175 [2025-03-17 11:57:29,802 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-03-17 11:57:29,803 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 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-03-17 11:57:29,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:57:29,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-17 11:57:29,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-03-17 11:57:29,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 139 states have (on average 1.669064748201439) internal successors, (232), 174 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:29,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 232 transitions. [2025-03-17 11:57:29,807 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 232 transitions. Word has length 13 [2025-03-17 11:57:29,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:29,807 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 232 transitions. [2025-03-17 11:57:29,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:29,807 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 232 transitions. [2025-03-17 11:57:29,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 11:57:29,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:29,808 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:29,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:57:29,808 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-03-17 11:57:29,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:29,808 INFO L85 PathProgramCache]: Analyzing trace with hash -55720484, now seen corresponding path program 1 times [2025-03-17 11:57:29,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:29,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133303269] [2025-03-17 11:57:29,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:29,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:29,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 11:57:29,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 11:57:29,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:29,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:29,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:29,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:29,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133303269] [2025-03-17 11:57:29,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133303269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:29,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:29,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:57:29,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315634778] [2025-03-17 11:57:29,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:29,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:57:29,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:29,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:57:29,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:29,847 INFO L87 Difference]: Start difference. First operand 175 states and 232 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-03-17 11:57:29,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:29,863 INFO L93 Difference]: Finished difference Result 181 states and 232 transitions. [2025-03-17 11:57:29,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:57:29,863 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-03-17 11:57:29,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:29,864 INFO L225 Difference]: With dead ends: 181 [2025-03-17 11:57:29,864 INFO L226 Difference]: Without dead ends: 181 [2025-03-17 11:57:29,864 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-03-17 11:57:29,865 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 4 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 211 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-03-17 11:57:29,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 211 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:57:29,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-17 11:57:29,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2025-03-17 11:57:29,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 141 states have (on average 1.6382978723404256) internal successors, (231), 176 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:29,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 231 transitions. [2025-03-17 11:57:29,874 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 231 transitions. Word has length 15 [2025-03-17 11:57:29,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:29,874 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 231 transitions. [2025-03-17 11:57:29,874 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-03-17 11:57:29,875 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 231 transitions. [2025-03-17 11:57:29,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 11:57:29,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:29,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:29,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:57:29,875 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-17 11:57:29,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:29,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1365105359, now seen corresponding path program 1 times [2025-03-17 11:57:29,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:29,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239928104] [2025-03-17 11:57:29,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:29,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:29,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 11:57:29,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 11:57:29,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:29,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:30,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:30,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:30,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239928104] [2025-03-17 11:57:30,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239928104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:30,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:30,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:57:30,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566730406] [2025-03-17 11:57:30,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:30,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:57:30,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:30,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:57:30,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:57:30,027 INFO L87 Difference]: Start difference. First operand 177 states and 231 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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-03-17 11:57:30,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:30,213 INFO L93 Difference]: Finished difference Result 256 states and 325 transitions. [2025-03-17 11:57:30,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:57:30,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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-03-17 11:57:30,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:30,214 INFO L225 Difference]: With dead ends: 256 [2025-03-17 11:57:30,214 INFO L226 Difference]: Without dead ends: 256 [2025-03-17 11:57:30,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:57:30,215 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 106 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 412 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-03-17 11:57:30,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 412 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:57:30,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-17 11:57:30,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 191. [2025-03-17 11:57:30,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 155 states have (on average 1.6129032258064515) internal successors, (250), 190 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 250 transitions. [2025-03-17 11:57:30,221 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 250 transitions. Word has length 15 [2025-03-17 11:57:30,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:30,221 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 250 transitions. [2025-03-17 11:57:30,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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-03-17 11:57:30,221 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 250 transitions. [2025-03-17 11:57:30,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 11:57:30,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:30,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:30,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:57:30,222 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-17 11:57:30,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:30,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1616080055, now seen corresponding path program 1 times [2025-03-17 11:57:30,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:30,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36069808] [2025-03-17 11:57:30,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:30,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:30,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 11:57:30,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:57:30,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:30,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:30,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:30,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:30,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36069808] [2025-03-17 11:57:30,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36069808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:30,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:30,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:57:30,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136305570] [2025-03-17 11:57:30,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:30,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:57:30,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:30,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:57:30,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:57:30,377 INFO L87 Difference]: Start difference. First operand 191 states and 250 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-03-17 11:57:30,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:30,544 INFO L93 Difference]: Finished difference Result 255 states and 323 transitions. [2025-03-17 11:57:30,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:57:30,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-03-17 11:57:30,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:30,545 INFO L225 Difference]: With dead ends: 255 [2025-03-17 11:57:30,545 INFO L226 Difference]: Without dead ends: 255 [2025-03-17 11:57:30,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:57:30,546 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 101 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 417 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-03-17 11:57:30,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 417 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:57:30,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-17 11:57:30,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2025-03-17 11:57:30,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 190 states have (on average 1.6157894736842104) internal successors, (307), 225 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:30,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 307 transitions. [2025-03-17 11:57:30,551 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 307 transitions. Word has length 16 [2025-03-17 11:57:30,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:30,551 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 307 transitions. [2025-03-17 11:57:30,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-03-17 11:57:30,551 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 307 transitions. [2025-03-17 11:57:30,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 11:57:30,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:30,553 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:30,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:57:30,554 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-17 11:57:30,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:30,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1727336300, now seen corresponding path program 1 times [2025-03-17 11:57:30,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:30,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961330041] [2025-03-17 11:57:30,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:30,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:30,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 11:57:30,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:57:30,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:30,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:30,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:30,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:30,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961330041] [2025-03-17 11:57:30,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961330041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:30,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:30,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:57:30,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550654111] [2025-03-17 11:57:30,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:30,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:57:30,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:30,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:57:30,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:57:30,600 INFO L87 Difference]: Start difference. First operand 226 states and 307 transitions. Second operand has 4 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-03-17 11:57:30,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:30,680 INFO L93 Difference]: Finished difference Result 255 states and 318 transitions. [2025-03-17 11:57:30,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:57:30,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-03-17 11:57:30,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:30,682 INFO L225 Difference]: With dead ends: 255 [2025-03-17 11:57:30,684 INFO L226 Difference]: Without dead ends: 255 [2025-03-17 11:57:30,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:57:30,684 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 209 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:30,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 189 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:57:30,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-17 11:57:30,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 227. [2025-03-17 11:57:30,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 191 states have (on average 1.612565445026178) internal successors, (308), 226 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:30,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 308 transitions. [2025-03-17 11:57:30,693 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 308 transitions. Word has length 16 [2025-03-17 11:57:30,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:30,693 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 308 transitions. [2025-03-17 11:57:30,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-03-17 11:57:30,693 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 308 transitions. [2025-03-17 11:57:30,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 11:57:30,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:30,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:30,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:57:30,694 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-03-17 11:57:30,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:30,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1116086810, now seen corresponding path program 1 times [2025-03-17 11:57:30,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:30,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292953697] [2025-03-17 11:57:30,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:30,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:30,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 11:57:30,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 11:57:30,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:30,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:30,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:30,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:30,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292953697] [2025-03-17 11:57:30,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292953697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:30,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:30,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:57:30,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705875433] [2025-03-17 11:57:30,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:30,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:57:30,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:30,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:57:30,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:57:30,775 INFO L87 Difference]: Start difference. First operand 227 states and 308 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-03-17 11:57:30,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:30,875 INFO L93 Difference]: Finished difference Result 226 states and 306 transitions. [2025-03-17 11:57:30,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:57:30,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-03-17 11:57:30,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:30,876 INFO L225 Difference]: With dead ends: 226 [2025-03-17 11:57:30,876 INFO L226 Difference]: Without dead ends: 226 [2025-03-17 11:57:30,876 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-03-17 11:57:30,876 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 3 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:30,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 283 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:57:30,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-17 11:57:30,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2025-03-17 11:57:30,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 191 states have (on average 1.6020942408376964) internal successors, (306), 225 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:30,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 306 transitions. [2025-03-17 11:57:30,880 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 306 transitions. Word has length 17 [2025-03-17 11:57:30,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:30,880 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 306 transitions. [2025-03-17 11:57:30,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-03-17 11:57:30,880 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 306 transitions. [2025-03-17 11:57:30,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 11:57:30,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:30,882 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:30,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:57:30,882 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-03-17 11:57:30,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:30,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1116086811, now seen corresponding path program 1 times [2025-03-17 11:57:30,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:30,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351474254] [2025-03-17 11:57:30,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:30,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:30,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 11:57:30,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 11:57:30,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:30,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:31,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:31,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:31,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351474254] [2025-03-17 11:57:31,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351474254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:31,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:31,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:57:31,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516723931] [2025-03-17 11:57:31,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:31,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:57:31,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:31,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:57:31,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:57:31,048 INFO L87 Difference]: Start difference. First operand 226 states and 306 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-03-17 11:57:31,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:31,174 INFO L93 Difference]: Finished difference Result 225 states and 304 transitions. [2025-03-17 11:57:31,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:57:31,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-03-17 11:57:31,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:31,175 INFO L225 Difference]: With dead ends: 225 [2025-03-17 11:57:31,175 INFO L226 Difference]: Without dead ends: 225 [2025-03-17 11:57:31,175 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-03-17 11:57:31,176 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 2 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 260 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-03-17 11:57:31,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 260 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:57:31,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-17 11:57:31,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2025-03-17 11:57:31,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 191 states have (on average 1.5916230366492146) internal successors, (304), 224 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:31,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 304 transitions. [2025-03-17 11:57:31,180 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 304 transitions. Word has length 17 [2025-03-17 11:57:31,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:31,181 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 304 transitions. [2025-03-17 11:57:31,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-03-17 11:57:31,181 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 304 transitions. [2025-03-17 11:57:31,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 11:57:31,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:31,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:31,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:57:31,181 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-17 11:57:31,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:31,186 INFO L85 PathProgramCache]: Analyzing trace with hash -2072513545, now seen corresponding path program 1 times [2025-03-17 11:57:31,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:31,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975540216] [2025-03-17 11:57:31,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:31,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:31,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 11:57:31,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 11:57:31,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:31,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:31,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:31,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:31,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975540216] [2025-03-17 11:57:31,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975540216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:31,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:31,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:57:31,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019915284] [2025-03-17 11:57:31,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:31,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:57:31,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:31,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:57:31,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:57:31,266 INFO L87 Difference]: Start difference. First operand 225 states and 304 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-03-17 11:57:31,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:31,375 INFO L93 Difference]: Finished difference Result 236 states and 320 transitions. [2025-03-17 11:57:31,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:57:31,376 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-03-17 11:57:31,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:31,377 INFO L225 Difference]: With dead ends: 236 [2025-03-17 11:57:31,377 INFO L226 Difference]: Without dead ends: 236 [2025-03-17 11:57:31,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:57:31,377 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 29 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:31,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 268 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:57:31,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-17 11:57:31,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 232. [2025-03-17 11:57:31,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 198 states have (on average 1.5808080808080809) internal successors, (313), 231 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:31,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 313 transitions. [2025-03-17 11:57:31,385 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 313 transitions. Word has length 18 [2025-03-17 11:57:31,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:31,386 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 313 transitions. [2025-03-17 11:57:31,386 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-03-17 11:57:31,387 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 313 transitions. [2025-03-17 11:57:31,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 11:57:31,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:31,387 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:31,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:57:31,387 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-17 11:57:31,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:31,389 INFO L85 PathProgramCache]: Analyzing trace with hash -2072359630, now seen corresponding path program 1 times [2025-03-17 11:57:31,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:31,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027195875] [2025-03-17 11:57:31,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:31,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:31,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 11:57:31,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 11:57:31,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:31,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:31,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:31,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:31,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027195875] [2025-03-17 11:57:31,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027195875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:31,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:31,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:57:31,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488611208] [2025-03-17 11:57:31,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:31,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:57:31,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:31,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:57:31,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:57:31,496 INFO L87 Difference]: Start difference. First operand 232 states and 313 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-03-17 11:57:31,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:31,643 INFO L93 Difference]: Finished difference Result 230 states and 293 transitions. [2025-03-17 11:57:31,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:57:31,644 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-03-17 11:57:31,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:31,645 INFO L225 Difference]: With dead ends: 230 [2025-03-17 11:57:31,645 INFO L226 Difference]: Without dead ends: 230 [2025-03-17 11:57:31,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:57:31,646 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 63 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:31,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 412 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:57:31,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-17 11:57:31,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 204. [2025-03-17 11:57:31,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 170 states have (on average 1.5470588235294118) internal successors, (263), 203 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:31,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 263 transitions. [2025-03-17 11:57:31,650 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 263 transitions. Word has length 18 [2025-03-17 11:57:31,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:31,650 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 263 transitions. [2025-03-17 11:57:31,650 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-03-17 11:57:31,650 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 263 transitions. [2025-03-17 11:57:31,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 11:57:31,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:31,651 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:31,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:57:31,651 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-17 11:57:31,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:31,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1072565234, now seen corresponding path program 1 times [2025-03-17 11:57:31,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:31,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234834561] [2025-03-17 11:57:31,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:31,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:31,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 11:57:31,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 11:57:31,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:31,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:31,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:31,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:31,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234834561] [2025-03-17 11:57:31,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234834561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:31,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:31,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:57:31,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011187681] [2025-03-17 11:57:31,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:31,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:57:31,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:31,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:57:31,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:57:31,680 INFO L87 Difference]: Start difference. First operand 204 states and 263 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-03-17 11:57:31,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:31,692 INFO L93 Difference]: Finished difference Result 179 states and 212 transitions. [2025-03-17 11:57:31,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:57:31,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-03-17 11:57:31,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:31,693 INFO L225 Difference]: With dead ends: 179 [2025-03-17 11:57:31,693 INFO L226 Difference]: Without dead ends: 179 [2025-03-17 11:57:31,693 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-03-17 11:57:31,693 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 2 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 212 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-03-17 11:57:31,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 212 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:57:31,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-17 11:57:31,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2025-03-17 11:57:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 176 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:31,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 212 transitions. [2025-03-17 11:57:31,697 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 212 transitions. Word has length 19 [2025-03-17 11:57:31,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:31,697 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 212 transitions. [2025-03-17 11:57:31,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-03-17 11:57:31,697 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 212 transitions. [2025-03-17 11:57:31,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 11:57:31,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:31,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:31,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:57:31,698 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-17 11:57:31,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:31,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1072566769, now seen corresponding path program 1 times [2025-03-17 11:57:31,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:31,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923584488] [2025-03-17 11:57:31,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:31,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:31,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 11:57:31,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 11:57:31,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:31,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:31,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:31,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:31,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923584488] [2025-03-17 11:57:31,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923584488] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:57:31,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384733568] [2025-03-17 11:57:31,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:31,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:57:31,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:57:31,762 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:57:31,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:57:31,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 11:57:31,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 11:57:31,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:31,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:31,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 11:57:31,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:57:31,898 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-03-17 11:57:31,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:31,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:57:31,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:31,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384733568] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:57:31,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:57:31,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-17 11:57:31,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502702270] [2025-03-17 11:57:31,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:57:31,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:57:31,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:31,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:57:31,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:57:31,980 INFO L87 Difference]: Start difference. First operand 177 states and 212 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 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-03-17 11:57:32,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:32,131 INFO L93 Difference]: Finished difference Result 187 states and 222 transitions. [2025-03-17 11:57:32,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:57:32,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 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 19 [2025-03-17 11:57:32,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:32,132 INFO L225 Difference]: With dead ends: 187 [2025-03-17 11:57:32,132 INFO L226 Difference]: Without dead ends: 171 [2025-03-17 11:57:32,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 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-03-17 11:57:32,132 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 39 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:32,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 351 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:57:32,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-17 11:57:32,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2025-03-17 11:57:32,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 135 states have (on average 1.5037037037037038) internal successors, (203), 168 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:32,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 203 transitions. [2025-03-17 11:57:32,135 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 203 transitions. Word has length 19 [2025-03-17 11:57:32,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:32,135 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 203 transitions. [2025-03-17 11:57:32,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 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-03-17 11:57:32,135 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 203 transitions. [2025-03-17 11:57:32,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 11:57:32,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:32,136 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] [2025-03-17 11:57:32,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 11:57:32,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 11:57:32,337 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-17 11:57:32,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:32,337 INFO L85 PathProgramCache]: Analyzing trace with hash 2000372890, now seen corresponding path program 1 times [2025-03-17 11:57:32,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:32,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106465060] [2025-03-17 11:57:32,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:32,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:32,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:57:32,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:57:32,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:32,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:32,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:32,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:32,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106465060] [2025-03-17 11:57:32,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106465060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:32,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:32,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:57:32,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112032038] [2025-03-17 11:57:32,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:32,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:57:32,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:32,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:57:32,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:57:32,474 INFO L87 Difference]: Start difference. First operand 169 states and 203 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:32,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:32,741 INFO L93 Difference]: Finished difference Result 224 states and 267 transitions. [2025-03-17 11:57:32,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:57:32,741 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-03-17 11:57:32,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:32,742 INFO L225 Difference]: With dead ends: 224 [2025-03-17 11:57:32,742 INFO L226 Difference]: Without dead ends: 224 [2025-03-17 11:57:32,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-17 11:57:32,742 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 190 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:32,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 248 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:57:32,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-17 11:57:32,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 168. [2025-03-17 11:57:32,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 135 states have (on average 1.488888888888889) internal successors, (201), 167 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:32,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 201 transitions. [2025-03-17 11:57:32,745 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 201 transitions. Word has length 20 [2025-03-17 11:57:32,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:32,745 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 201 transitions. [2025-03-17 11:57:32,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:32,746 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 201 transitions. [2025-03-17 11:57:32,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 11:57:32,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:32,746 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] [2025-03-17 11:57:32,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:57:32,746 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-17 11:57:32,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:32,746 INFO L85 PathProgramCache]: Analyzing trace with hash 2000372891, now seen corresponding path program 1 times [2025-03-17 11:57:32,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:32,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000075667] [2025-03-17 11:57:32,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:32,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:32,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:57:32,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:57:32,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:32,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:32,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:32,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:32,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000075667] [2025-03-17 11:57:32,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000075667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:32,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:32,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:57:32,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677408226] [2025-03-17 11:57:32,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:32,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:57:32,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:32,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:57:32,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:57:32,927 INFO L87 Difference]: Start difference. First operand 168 states and 201 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:33,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:33,173 INFO L93 Difference]: Finished difference Result 223 states and 265 transitions. [2025-03-17 11:57:33,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:57:33,174 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-03-17 11:57:33,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:33,174 INFO L225 Difference]: With dead ends: 223 [2025-03-17 11:57:33,174 INFO L226 Difference]: Without dead ends: 223 [2025-03-17 11:57:33,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-17 11:57:33,175 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 188 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:33,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 195 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:57:33,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-17 11:57:33,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 167. [2025-03-17 11:57:33,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 135 states have (on average 1.474074074074074) internal successors, (199), 166 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:33,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 199 transitions. [2025-03-17 11:57:33,178 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 199 transitions. Word has length 20 [2025-03-17 11:57:33,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:33,179 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 199 transitions. [2025-03-17 11:57:33,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:33,179 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 199 transitions. [2025-03-17 11:57:33,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 11:57:33,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:33,180 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:33,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:57:33,180 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-03-17 11:57:33,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:33,180 INFO L85 PathProgramCache]: Analyzing trace with hash -528473032, now seen corresponding path program 1 times [2025-03-17 11:57:33,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:33,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70293980] [2025-03-17 11:57:33,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:33,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:33,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 11:57:33,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 11:57:33,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:33,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:33,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:33,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70293980] [2025-03-17 11:57:33,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70293980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:33,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:33,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:57:33,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973836677] [2025-03-17 11:57:33,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:33,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:57:33,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:33,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:57:33,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:57:33,252 INFO L87 Difference]: Start difference. First operand 167 states and 199 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-03-17 11:57:33,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:33,346 INFO L93 Difference]: Finished difference Result 166 states and 197 transitions. [2025-03-17 11:57:33,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:57:33,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-03-17 11:57:33,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:33,347 INFO L225 Difference]: With dead ends: 166 [2025-03-17 11:57:33,347 INFO L226 Difference]: Without dead ends: 166 [2025-03-17 11:57:33,347 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-03-17 11:57:33,348 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 3 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 273 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-03-17 11:57:33,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 273 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:57:33,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-17 11:57:33,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2025-03-17 11:57:33,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 135 states have (on average 1.4592592592592593) internal successors, (197), 165 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:33,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 197 transitions. [2025-03-17 11:57:33,350 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 197 transitions. Word has length 21 [2025-03-17 11:57:33,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:33,350 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 197 transitions. [2025-03-17 11:57:33,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-03-17 11:57:33,351 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 197 transitions. [2025-03-17 11:57:33,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 11:57:33,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:33,351 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:33,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:57:33,351 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-17 11:57:33,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:33,351 INFO L85 PathProgramCache]: Analyzing trace with hash -528473031, now seen corresponding path program 1 times [2025-03-17 11:57:33,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:33,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095442137] [2025-03-17 11:57:33,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:33,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:33,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 11:57:33,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 11:57:33,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:33,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:33,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:33,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:33,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095442137] [2025-03-17 11:57:33,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095442137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:33,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:33,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:57:33,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979490466] [2025-03-17 11:57:33,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:33,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:57:33,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:33,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:57:33,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:57:33,438 INFO L87 Difference]: Start difference. First operand 166 states and 197 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-03-17 11:57:33,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:33,547 INFO L93 Difference]: Finished difference Result 165 states and 195 transitions. [2025-03-17 11:57:33,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:57:33,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-03-17 11:57:33,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:33,548 INFO L225 Difference]: With dead ends: 165 [2025-03-17 11:57:33,548 INFO L226 Difference]: Without dead ends: 165 [2025-03-17 11:57:33,549 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-03-17 11:57:33,549 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 2 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:33,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 250 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:57:33,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-17 11:57:33,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-03-17 11:57:33,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 135 states have (on average 1.4444444444444444) internal successors, (195), 164 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:33,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 195 transitions. [2025-03-17 11:57:33,552 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 195 transitions. Word has length 21 [2025-03-17 11:57:33,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:33,552 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 195 transitions. [2025-03-17 11:57:33,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-03-17 11:57:33,552 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 195 transitions. [2025-03-17 11:57:33,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 11:57:33,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:33,552 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] [2025-03-17 11:57:33,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:57:33,552 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-17 11:57:33,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:33,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1610039522, now seen corresponding path program 1 times [2025-03-17 11:57:33,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:33,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634166737] [2025-03-17 11:57:33,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:33,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:33,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 11:57:33,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 11:57:33,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:33,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:33,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:33,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:33,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634166737] [2025-03-17 11:57:33,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634166737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:33,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:33,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:57:33,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540859028] [2025-03-17 11:57:33,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:33,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:57:33,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:33,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:57:33,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:57:33,706 INFO L87 Difference]: Start difference. First operand 165 states and 195 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 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-03-17 11:57:33,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:33,931 INFO L93 Difference]: Finished difference Result 220 states and 260 transitions. [2025-03-17 11:57:33,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:57:33,932 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 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 24 [2025-03-17 11:57:33,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:33,933 INFO L225 Difference]: With dead ends: 220 [2025-03-17 11:57:33,933 INFO L226 Difference]: Without dead ends: 220 [2025-03-17 11:57:33,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-17 11:57:33,934 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 177 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:33,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 200 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:57:33,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-17 11:57:33,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 164. [2025-03-17 11:57:33,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 135 states have (on average 1.4370370370370371) internal successors, (194), 163 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:33,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 194 transitions. [2025-03-17 11:57:33,937 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 194 transitions. Word has length 24 [2025-03-17 11:57:33,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:33,938 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 194 transitions. [2025-03-17 11:57:33,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 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-03-17 11:57:33,938 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 194 transitions. [2025-03-17 11:57:33,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 11:57:33,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:33,938 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] [2025-03-17 11:57:33,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:57:33,938 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-17 11:57:33,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:33,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1610039523, now seen corresponding path program 1 times [2025-03-17 11:57:33,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:33,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018840719] [2025-03-17 11:57:33,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:33,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:33,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 11:57:33,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 11:57:33,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:33,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:34,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:34,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:34,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018840719] [2025-03-17 11:57:34,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018840719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:34,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:34,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:57:34,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423635998] [2025-03-17 11:57:34,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:34,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:57:34,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:34,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:57:34,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:57:34,132 INFO L87 Difference]: Start difference. First operand 164 states and 194 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 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-03-17 11:57:34,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:34,387 INFO L93 Difference]: Finished difference Result 219 states and 259 transitions. [2025-03-17 11:57:34,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:57:34,387 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 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 24 [2025-03-17 11:57:34,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:34,388 INFO L225 Difference]: With dead ends: 219 [2025-03-17 11:57:34,388 INFO L226 Difference]: Without dead ends: 219 [2025-03-17 11:57:34,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-17 11:57:34,388 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 176 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:34,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 227 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:57:34,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-17 11:57:34,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 163. [2025-03-17 11:57:34,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 135 states have (on average 1.4296296296296296) internal successors, (193), 162 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:34,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 193 transitions. [2025-03-17 11:57:34,391 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 193 transitions. Word has length 24 [2025-03-17 11:57:34,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:34,391 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 193 transitions. [2025-03-17 11:57:34,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 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-03-17 11:57:34,391 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 193 transitions. [2025-03-17 11:57:34,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 11:57:34,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:34,391 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:34,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:57:34,392 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-03-17 11:57:34,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:34,392 INFO L85 PathProgramCache]: Analyzing trace with hash -677977541, now seen corresponding path program 1 times [2025-03-17 11:57:34,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:34,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892843300] [2025-03-17 11:57:34,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:34,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:34,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 11:57:34,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 11:57:34,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:34,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:34,655 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:34,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:34,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892843300] [2025-03-17 11:57:34,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892843300] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:57:34,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276591182] [2025-03-17 11:57:34,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:34,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:57:34,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:57:34,657 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:57:34,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:57:34,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 11:57:34,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 11:57:34,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:34,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:34,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 11:57:34,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:57:34,904 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:34,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:57:34,991 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-03-17 11:57:34,991 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-03-17 11:57:34,998 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-03-17 11:57:34,998 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-03-17 11:57:35,041 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:35,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276591182] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:57:35,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:57:35,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-17 11:57:35,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886681448] [2025-03-17 11:57:35,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:57:35,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 11:57:35,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:35,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 11:57:35,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-03-17 11:57:35,043 INFO L87 Difference]: Start difference. First operand 163 states and 193 transitions. Second operand has 19 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 19 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:35,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:35,547 INFO L93 Difference]: Finished difference Result 253 states and 299 transitions. [2025-03-17 11:57:35,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 11:57:35,547 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 19 states have internal predecessors, (73), 0 states have call successors, (0), 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 37 [2025-03-17 11:57:35,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:35,548 INFO L225 Difference]: With dead ends: 253 [2025-03-17 11:57:35,548 INFO L226 Difference]: Without dead ends: 253 [2025-03-17 11:57:35,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=692, Unknown=0, NotChecked=0, Total=870 [2025-03-17 11:57:35,549 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 457 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:35,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 716 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:57:35,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-17 11:57:35,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 187. [2025-03-17 11:57:35,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 159 states have (on average 1.389937106918239) internal successors, (221), 186 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:35,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 221 transitions. [2025-03-17 11:57:35,553 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 221 transitions. Word has length 37 [2025-03-17 11:57:35,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:35,554 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 221 transitions. [2025-03-17 11:57:35,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 19 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:35,554 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 221 transitions. [2025-03-17 11:57:35,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 11:57:35,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:35,555 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:35,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 11:57:35,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-17 11:57:35,755 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-17 11:57:35,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:35,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1192498501, now seen corresponding path program 1 times [2025-03-17 11:57:35,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:35,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352465559] [2025-03-17 11:57:35,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:35,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:35,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 11:57:35,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 11:57:35,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:35,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:36,123 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:36,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:36,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352465559] [2025-03-17 11:57:36,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352465559] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:57:36,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725275055] [2025-03-17 11:57:36,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:36,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:57:36,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:57:36,125 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:57:36,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 11:57:36,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 11:57:36,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 11:57:36,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:36,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:36,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 11:57:36,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:57:36,277 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:57:36,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:57:36,298 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-03-17 11:57:36,356 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:57:36,357 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-03-17 11:57:36,423 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:57:36,424 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-03-17 11:57:36,489 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-03-17 11:57:36,517 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:36,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:57:36,612 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_545 (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_545) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) 1)) is different from false [2025-03-17 11:57:36,627 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-03-17 11:57:36,627 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-03-17 11:57:36,666 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_544 (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_544))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_545)) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4)))))) is different from false [2025-03-17 11:57:36,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:36,692 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-03-17 11:57:36,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:36,701 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-03-17 11:57:36,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:36,715 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 86 treesize of output 74 [2025-03-17 11:57:36,720 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 66 treesize of output 58 [2025-03-17 11:57:36,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:36,944 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-03-17 11:57:36,967 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:36,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725275055] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:57:36,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:57:36,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2025-03-17 11:57:36,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395256114] [2025-03-17 11:57:36,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:57:36,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-17 11:57:36,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:36,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 11:57:36,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=640, Unknown=26, NotChecked=106, Total=870 [2025-03-17 11:57:36,969 INFO L87 Difference]: Start difference. First operand 187 states and 221 transitions. Second operand has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:38,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:38,556 INFO L93 Difference]: Finished difference Result 487 states and 583 transitions. [2025-03-17 11:57:38,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-17 11:57:38,557 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-17 11:57:38,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:38,558 INFO L225 Difference]: With dead ends: 487 [2025-03-17 11:57:38,558 INFO L226 Difference]: Without dead ends: 487 [2025-03-17 11:57:38,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=475, Invalid=2580, Unknown=33, NotChecked=218, Total=3306 [2025-03-17 11:57:38,559 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 871 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 2034 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 3044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 923 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:38,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 1277 Invalid, 3044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2034 Invalid, 0 Unknown, 923 Unchecked, 1.0s Time] [2025-03-17 11:57:38,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-03-17 11:57:38,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 267. [2025-03-17 11:57:38,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 239 states have (on average 1.393305439330544) internal successors, (333), 266 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:38,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 333 transitions. [2025-03-17 11:57:38,565 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 333 transitions. Word has length 37 [2025-03-17 11:57:38,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:38,565 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 333 transitions. [2025-03-17 11:57:38,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:38,566 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 333 transitions. [2025-03-17 11:57:38,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 11:57:38,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:38,566 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] [2025-03-17 11:57:38,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 11:57:38,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:57:38,767 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-17 11:57:38,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:38,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1442205933, now seen corresponding path program 1 times [2025-03-17 11:57:38,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:38,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052522296] [2025-03-17 11:57:38,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:38,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:38,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 11:57:38,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 11:57:38,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:38,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:39,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:39,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:39,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052522296] [2025-03-17 11:57:39,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052522296] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:57:39,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957647489] [2025-03-17 11:57:39,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:39,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:57:39,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:57:39,120 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:57:39,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 11:57:39,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 11:57:39,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 11:57:39,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:39,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:39,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-17 11:57:39,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:57:39,274 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:57:39,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:57:39,279 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-03-17 11:57:39,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:57:39,310 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-03-17 11:57:39,376 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 11:57:39,376 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-03-17 11:57:39,379 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-03-17 11:57:39,423 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 11:57:39,423 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-03-17 11:57:39,427 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-03-17 11:57:39,524 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-03-17 11:57:39,527 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-03-17 11:57:39,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:39,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:57:39,680 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_620) |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_621) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))) (forall ((v_ArrVal_620 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_620) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))) is different from false [2025-03-17 11:57:39,687 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_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_620) |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| .cse0 v_ArrVal_621) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))) (forall ((v_ArrVal_620 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_620) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))) is different from false [2025-03-17 11:57:39,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:39,844 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 73 treesize of output 74 [2025-03-17 11:57:39,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:39,848 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 65 treesize of output 50 [2025-03-17 11:57:39,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:39,857 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 632 treesize of output 567 [2025-03-17 11:57:39,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:39,879 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 1127 treesize of output 1070 [2025-03-17 11:57:39,898 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 547 treesize of output 523 [2025-03-17 11:57:39,916 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 523 treesize of output 499 [2025-03-17 11:57:39,924 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 499 treesize of output 491 [2025-03-17 11:57:39,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:39,937 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 491 treesize of output 447 [2025-03-17 11:57:40,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:40,095 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 37 [2025-03-17 11:57:40,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:40,100 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 30 treesize of output 31 [2025-03-17 11:57:40,102 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:57:40,103 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 28 treesize of output 20 [2025-03-17 11:57:40,105 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:57:40,107 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 18 treesize of output 10 [2025-03-17 11:57:40,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:40,226 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-03-17 11:57:40,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:40,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957647489] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:57:40,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:57:40,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 31 [2025-03-17 11:57:40,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722814326] [2025-03-17 11:57:40,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:57:40,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 11:57:40,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:40,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 11:57:40,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=712, Unknown=37, NotChecked=114, Total=992 [2025-03-17 11:57:40,242 INFO L87 Difference]: Start difference. First operand 267 states and 333 transitions. Second operand has 32 states, 31 states have (on average 3.2903225806451615) internal successors, (102), 32 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:41,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:41,264 INFO L93 Difference]: Finished difference Result 436 states and 536 transitions. [2025-03-17 11:57:41,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 11:57:41,265 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.2903225806451615) internal successors, (102), 32 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-17 11:57:41,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:41,266 INFO L225 Difference]: With dead ends: 436 [2025-03-17 11:57:41,266 INFO L226 Difference]: Without dead ends: 436 [2025-03-17 11:57:41,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=325, Invalid=1529, Unknown=46, NotChecked=170, Total=2070 [2025-03-17 11:57:41,267 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 835 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 2114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 638 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:41,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 919 Invalid, 2114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1396 Invalid, 0 Unknown, 638 Unchecked, 0.7s Time] [2025-03-17 11:57:41,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-17 11:57:41,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 336. [2025-03-17 11:57:41,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 314 states have (on average 1.39171974522293) internal successors, (437), 335 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:41,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 437 transitions. [2025-03-17 11:57:41,272 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 437 transitions. Word has length 38 [2025-03-17 11:57:41,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:41,272 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 437 transitions. [2025-03-17 11:57:41,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.2903225806451615) internal successors, (102), 32 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:41,272 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 437 transitions. [2025-03-17 11:57:41,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 11:57:41,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:41,273 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] [2025-03-17 11:57:41,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 11:57:41,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-17 11:57:41,473 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-17 11:57:41,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:41,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1442205932, now seen corresponding path program 1 times [2025-03-17 11:57:41,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:41,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338192442] [2025-03-17 11:57:41,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:41,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:41,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 11:57:41,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 11:57:41,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:41,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:41,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:41,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:41,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338192442] [2025-03-17 11:57:41,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338192442] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:57:41,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416169829] [2025-03-17 11:57:41,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:41,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:57:41,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:57:41,724 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:57:41,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 11:57:41,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 11:57:41,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 11:57:41,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:41,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:41,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 11:57:41,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:57:41,857 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:57:41,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:57:41,879 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-03-17 11:57:41,926 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 11:57:41,926 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-03-17 11:57:41,969 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 11:57:41,969 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-03-17 11:57:42,032 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-03-17 11:57:42,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:42,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:57:42,109 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-03-17 11:57:42,109 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 29 treesize of output 28 [2025-03-17 11:57:42,113 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_692))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_693)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) |c_ULTIMATE.start_main_#t~mem15#1.base|)) is different from false [2025-03-17 11:57:42,118 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_692))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_693)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) .cse1))) is different from false [2025-03-17 11:57:42,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:42,126 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 29 [2025-03-17 11:57:42,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:42,133 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 136 treesize of output 123 [2025-03-17 11:57:42,138 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 72 treesize of output 68 [2025-03-17 11:57:42,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:42,144 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 68 treesize of output 66 [2025-03-17 11:57:42,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:42,304 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-03-17 11:57:42,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:42,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416169829] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:57:42,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:57:42,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2025-03-17 11:57:42,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50974488] [2025-03-17 11:57:42,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:57:42,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 11:57:42,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:42,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 11:57:42,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=415, Unknown=12, NotChecked=86, Total=600 [2025-03-17 11:57:42,325 INFO L87 Difference]: Start difference. First operand 336 states and 437 transitions. Second operand has 25 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 25 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:42,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:42,897 INFO L93 Difference]: Finished difference Result 422 states and 527 transitions. [2025-03-17 11:57:42,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 11:57:42,898 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 25 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-17 11:57:42,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:42,899 INFO L225 Difference]: With dead ends: 422 [2025-03-17 11:57:42,899 INFO L226 Difference]: Without dead ends: 422 [2025-03-17 11:57:42,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=214, Invalid=834, Unknown=16, NotChecked=126, Total=1190 [2025-03-17 11:57:42,900 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 750 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 1832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 576 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:42,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 865 Invalid, 1832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1188 Invalid, 0 Unknown, 576 Unchecked, 0.4s Time] [2025-03-17 11:57:42,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-03-17 11:57:42,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 336. [2025-03-17 11:57:42,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 314 states have (on average 1.3885350318471337) internal successors, (436), 335 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:42,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 436 transitions. [2025-03-17 11:57:42,905 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 436 transitions. Word has length 38 [2025-03-17 11:57:42,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:42,905 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 436 transitions. [2025-03-17 11:57:42,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 25 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:42,905 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 436 transitions. [2025-03-17 11:57:42,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 11:57:42,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:42,905 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] [2025-03-17 11:57:42,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 11:57:43,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-17 11:57:43,110 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-17 11:57:43,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:43,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1442359848, now seen corresponding path program 1 times [2025-03-17 11:57:43,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:43,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84092918] [2025-03-17 11:57:43,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:43,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:43,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 11:57:43,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 11:57:43,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:43,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:57:43,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:43,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84092918] [2025-03-17 11:57:43,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84092918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:43,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:57:43,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:57:43,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744787962] [2025-03-17 11:57:43,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:43,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:57:43,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:43,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:57:43,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:57:43,189 INFO L87 Difference]: Start difference. First operand 336 states and 436 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:43,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:43,310 INFO L93 Difference]: Finished difference Result 336 states and 433 transitions. [2025-03-17 11:57:43,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:57:43,311 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-17 11:57:43,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:43,312 INFO L225 Difference]: With dead ends: 336 [2025-03-17 11:57:43,312 INFO L226 Difference]: Without dead ends: 336 [2025-03-17 11:57:43,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:57:43,312 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 2 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:43,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 297 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:57:43,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-17 11:57:43,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 333. [2025-03-17 11:57:43,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 311 states have (on average 1.382636655948553) internal successors, (430), 332 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:43,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 430 transitions. [2025-03-17 11:57:43,317 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 430 transitions. Word has length 38 [2025-03-17 11:57:43,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:43,318 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 430 transitions. [2025-03-17 11:57:43,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:43,318 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 430 transitions. [2025-03-17 11:57:43,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 11:57:43,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:43,318 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] [2025-03-17 11:57:43,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 11:57:43,318 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-17 11:57:43,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:43,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1623041939, now seen corresponding path program 1 times [2025-03-17 11:57:43,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:43,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242872639] [2025-03-17 11:57:43,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:43,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:43,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 11:57:43,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 11:57:43,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:43,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:43,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:43,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:43,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242872639] [2025-03-17 11:57:43,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242872639] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:57:43,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820130632] [2025-03-17 11:57:43,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:43,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:57:43,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:57:43,664 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:57:43,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 11:57:43,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 11:57:43,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 11:57:43,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:43,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:43,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-17 11:57:43,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:57:43,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:57:43,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:57:43,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 11:57:43,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 11:57:43,886 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:57:43,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:57:43,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:57:43,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 11:57:43,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:57:43,903 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 27 treesize of output 11 [2025-03-17 11:57:43,955 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:57:43,955 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 58 treesize of output 53 [2025-03-17 11:57:43,961 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 28 treesize of output 11 [2025-03-17 11:57:44,005 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:57:44,005 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 58 treesize of output 53 [2025-03-17 11:57:44,008 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 28 treesize of output 11 [2025-03-17 11:57:44,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:44,085 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:57:44,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820130632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:44,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:57:44,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [12] total 19 [2025-03-17 11:57:44,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517619741] [2025-03-17 11:57:44,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:44,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:57:44,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:44,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:57:44,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2025-03-17 11:57:44,086 INFO L87 Difference]: Start difference. First operand 333 states and 430 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:44,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:44,394 INFO L93 Difference]: Finished difference Result 439 states and 549 transitions. [2025-03-17 11:57:44,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 11:57:44,395 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-17 11:57:44,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:44,396 INFO L225 Difference]: With dead ends: 439 [2025-03-17 11:57:44,396 INFO L226 Difference]: Without dead ends: 439 [2025-03-17 11:57:44,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2025-03-17 11:57:44,397 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 191 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:44,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 676 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:57:44,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-03-17 11:57:44,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 338. [2025-03-17 11:57:44,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 316 states have (on average 1.3765822784810127) internal successors, (435), 337 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:44,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 435 transitions. [2025-03-17 11:57:44,403 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 435 transitions. Word has length 38 [2025-03-17 11:57:44,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:44,403 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 435 transitions. [2025-03-17 11:57:44,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:44,403 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 435 transitions. [2025-03-17 11:57:44,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 11:57:44,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:44,403 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] [2025-03-17 11:57:44,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 11:57:44,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-17 11:57:44,604 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-17 11:57:44,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:44,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1661666328, now seen corresponding path program 1 times [2025-03-17 11:57:44,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:44,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436505674] [2025-03-17 11:57:44,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:44,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:44,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 11:57:44,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 11:57:44,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:44,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:44,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:44,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:44,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436505674] [2025-03-17 11:57:44,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436505674] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:57:44,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078843654] [2025-03-17 11:57:44,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:44,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:57:44,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:57:44,847 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:57:44,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 11:57:44,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 11:57:44,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 11:57:44,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:44,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:44,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 11:57:44,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:57:45,018 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:57:45,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:57:45,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-03-17 11:57:45,073 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 11:57:45,073 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 33 treesize of output 32 [2025-03-17 11:57:45,101 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 11:57:45,102 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 33 treesize of output 32 [2025-03-17 11:57:45,143 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 24 treesize of output 12 [2025-03-17 11:57:45,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:45,159 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:57:45,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078843654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:57:45,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:57:45,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 19 [2025-03-17 11:57:45,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676730563] [2025-03-17 11:57:45,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:57:45,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 11:57:45,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:45,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 11:57:45,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2025-03-17 11:57:45,160 INFO L87 Difference]: Start difference. First operand 338 states and 435 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:45,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:45,476 INFO L93 Difference]: Finished difference Result 417 states and 516 transitions. [2025-03-17 11:57:45,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 11:57:45,477 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-17 11:57:45,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:45,478 INFO L225 Difference]: With dead ends: 417 [2025-03-17 11:57:45,478 INFO L226 Difference]: Without dead ends: 417 [2025-03-17 11:57:45,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2025-03-17 11:57:45,478 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 183 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:45,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 737 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:57:45,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-17 11:57:45,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 338. [2025-03-17 11:57:45,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 316 states have (on average 1.3734177215189873) internal successors, (434), 337 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:45,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 434 transitions. [2025-03-17 11:57:45,482 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 434 transitions. Word has length 40 [2025-03-17 11:57:45,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:45,483 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 434 transitions. [2025-03-17 11:57:45,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:45,483 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 434 transitions. [2025-03-17 11:57:45,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 11:57:45,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:45,483 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] [2025-03-17 11:57:45,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 11:57:45,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:57:45,687 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-17 11:57:45,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:45,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1017306264, now seen corresponding path program 1 times [2025-03-17 11:57:45,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:45,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948983823] [2025-03-17 11:57:45,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:45,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:45,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 11:57:45,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 11:57:45,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:45,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:46,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:46,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:46,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948983823] [2025-03-17 11:57:46,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948983823] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:57:46,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419727057] [2025-03-17 11:57:46,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:46,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:57:46,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:57:46,153 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:57:46,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 11:57:46,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 11:57:46,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 11:57:46,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:46,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:46,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-17 11:57:46,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:57:46,329 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:57:46,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:57:46,335 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-03-17 11:57:46,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:57:46,380 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-03-17 11:57:46,447 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:57:46,447 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-03-17 11:57:46,453 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-03-17 11:57:46,495 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:57:46,495 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-03-17 11:57:46,501 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-03-17 11:57:46,589 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-03-17 11:57:46,591 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-03-17 11:57:46,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:46,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:57:46,727 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) (and (forall ((v_ArrVal_959 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_959) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0))) (forall ((v_ArrVal_959 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_959) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_960) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0)))))) is different from false [2025-03-17 11:57:46,779 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((v_ArrVal_957 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_957) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_959) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1))) (forall ((v_ArrVal_957 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_958))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_957) .cse2 v_ArrVal_959) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_960) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1)))))))) is different from false [2025-03-17 11:57:46,786 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_ArrVal_957 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_957) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_958) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_959) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))) (forall ((v_ArrVal_957 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_958))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_957) .cse3 v_ArrVal_959) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_960) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))))))))) is different from false [2025-03-17 11:57:46,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:46,800 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-03-17 11:57:46,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:46,804 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-03-17 11:57:46,806 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-03-17 11:57:46,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:46,813 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 200 treesize of output 187 [2025-03-17 11:57:46,820 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 66 treesize of output 62 [2025-03-17 11:57:46,824 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 88 treesize of output 76 [2025-03-17 11:57:46,827 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 54 treesize of output 46 [2025-03-17 11:57:46,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:46,869 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-03-17 11:57:46,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:46,874 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-03-17 11:57:46,876 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:57:46,877 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:57:46,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:57:46,879 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-03-17 11:57:46,882 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:57:46,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:57:46,883 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-03-17 11:57:47,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:47,035 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-03-17 11:57:47,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:47,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419727057] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:57:47,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:57:47,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 35 [2025-03-17 11:57:47,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965780683] [2025-03-17 11:57:47,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:57:47,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-17 11:57:47,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:47,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-17 11:57:47,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=896, Unknown=20, NotChecked=192, Total=1260 [2025-03-17 11:57:47,072 INFO L87 Difference]: Start difference. First operand 338 states and 434 transitions. Second operand has 36 states, 35 states have (on average 3.2857142857142856) internal successors, (115), 36 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:48,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:48,863 INFO L93 Difference]: Finished difference Result 939 states and 1140 transitions. [2025-03-17 11:57:48,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-17 11:57:48,864 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.2857142857142856) internal successors, (115), 36 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-17 11:57:48,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:48,866 INFO L225 Difference]: With dead ends: 939 [2025-03-17 11:57:48,866 INFO L226 Difference]: Without dead ends: 939 [2025-03-17 11:57:48,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1564 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=987, Invalid=4398, Unknown=29, NotChecked=438, Total=5852 [2025-03-17 11:57:48,867 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 1565 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 2227 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1565 SdHoareTripleChecker+Valid, 1637 SdHoareTripleChecker+Invalid, 4529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2162 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:48,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1565 Valid, 1637 Invalid, 4529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2227 Invalid, 0 Unknown, 2162 Unchecked, 0.9s Time] [2025-03-17 11:57:48,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2025-03-17 11:57:48,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 367. [2025-03-17 11:57:48,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 345 states have (on average 1.3652173913043477) internal successors, (471), 366 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:48,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 471 transitions. [2025-03-17 11:57:48,873 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 471 transitions. Word has length 40 [2025-03-17 11:57:48,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:48,873 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 471 transitions. [2025-03-17 11:57:48,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.2857142857142856) internal successors, (115), 36 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:48,873 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 471 transitions. [2025-03-17 11:57:48,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 11:57:48,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:48,873 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] [2025-03-17 11:57:48,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 11:57:49,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-03-17 11:57:49,078 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-17 11:57:49,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:49,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1017306265, now seen corresponding path program 1 times [2025-03-17 11:57:49,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:49,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592976923] [2025-03-17 11:57:49,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:49,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:49,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 11:57:49,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 11:57:49,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:49,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:49,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:49,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:49,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592976923] [2025-03-17 11:57:49,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592976923] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:57:49,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529236980] [2025-03-17 11:57:49,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:49,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:57:49,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:57:49,709 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:57:49,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 11:57:49,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 11:57:49,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 11:57:49,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:49,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:49,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 11:57:49,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:57:49,880 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:57:49,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:57:49,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 11:57:49,953 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:57:49,953 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-03-17 11:57:49,978 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:57:49,978 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-03-17 11:57:50,041 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-03-17 11:57:50,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:50,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:57:50,103 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-03-17 11:57:50,103 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-03-17 11:57:50,106 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1032 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1032) |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-03-17 11:57:50,110 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1032 (Array Int Int))) (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)))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1032) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))))) is different from false [2025-03-17 11:57:50,115 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1032 (Array Int Int)) (v_ArrVal_1031 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1031))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1032) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4)))))) is different from false [2025-03-17 11:57:50,119 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1032 (Array Int Int)) (v_ArrVal_1031 (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_1031))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1032) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))))))) is different from false [2025-03-17 11:57:50,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:50,126 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-03-17 11:57:50,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:50,134 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 420 treesize of output 317 [2025-03-17 11:57:50,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:50,145 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 82 treesize of output 63 [2025-03-17 11:57:50,148 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-03-17 11:57:50,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:50,316 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-03-17 11:57:50,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:50,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529236980] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:57:50,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:57:50,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 12] total 34 [2025-03-17 11:57:50,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221849839] [2025-03-17 11:57:50,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:57:50,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-17 11:57:50,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:50,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-17 11:57:50,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=836, Unknown=4, NotChecked=244, Total=1190 [2025-03-17 11:57:50,330 INFO L87 Difference]: Start difference. First operand 367 states and 471 transitions. Second operand has 35 states, 34 states have (on average 3.264705882352941) internal successors, (111), 35 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:52,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:52,296 INFO L93 Difference]: Finished difference Result 908 states and 1123 transitions. [2025-03-17 11:57:52,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-17 11:57:52,296 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.264705882352941) internal successors, (111), 35 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-17 11:57:52,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:52,298 INFO L225 Difference]: With dead ends: 908 [2025-03-17 11:57:52,298 INFO L226 Difference]: Without dead ends: 908 [2025-03-17 11:57:52,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 72 SyntacticMatches, 6 SemanticMatches, 78 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1729 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=962, Invalid=4750, Unknown=4, NotChecked=604, Total=6320 [2025-03-17 11:57:52,300 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 1917 mSDsluCounter, 1652 mSDsCounter, 0 mSdLazyCounter, 2400 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1917 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 5346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 2400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2724 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:52,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1917 Valid, 1732 Invalid, 5346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 2400 Invalid, 0 Unknown, 2724 Unchecked, 1.0s Time] [2025-03-17 11:57:52,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2025-03-17 11:57:52,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 450. [2025-03-17 11:57:52,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 428 states have (on average 1.3738317757009346) internal successors, (588), 449 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:52,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 588 transitions. [2025-03-17 11:57:52,309 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 588 transitions. Word has length 40 [2025-03-17 11:57:52,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:52,309 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 588 transitions. [2025-03-17 11:57:52,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.264705882352941) internal successors, (111), 35 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:52,309 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 588 transitions. [2025-03-17 11:57:52,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 11:57:52,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:52,310 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] [2025-03-17 11:57:52,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 11:57:52,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:57:52,510 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-17 11:57:52,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:52,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1569316505, now seen corresponding path program 1 times [2025-03-17 11:57:52,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:52,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525996550] [2025-03-17 11:57:52,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:52,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:52,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 11:57:52,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 11:57:52,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:52,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:52,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:52,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:52,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525996550] [2025-03-17 11:57:52,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525996550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:57:52,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956244553] [2025-03-17 11:57:52,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:52,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:57:52,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:57:52,716 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:57:52,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 11:57:52,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 11:57:52,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 11:57:52,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:52,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:52,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 11:57:52,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:57:52,910 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:57:52,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:57:52,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-03-17 11:57:52,986 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 11:57:52,986 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 33 treesize of output 32 [2025-03-17 11:57:53,023 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 11:57:53,023 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 33 treesize of output 32 [2025-03-17 11:57:53,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:53,087 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 26 treesize of output 20 [2025-03-17 11:57:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:53,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:57:53,276 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1107 (Array Int Int))) (not (= (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_1107) |c_ULTIMATE.start_main_~root~0#1.base|) 4) 0))) is different from false [2025-03-17 11:57:53,281 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1106 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1106))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_1107)) |c_ULTIMATE.start_main_~root~0#1.base|) 4) 0))) is different from false [2025-03-17 11:57:53,284 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1106 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1106))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1107))) |c_ULTIMATE.start_main_~root~0#1.base|) 4) 0))) is different from false [2025-03-17 11:57:53,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:53,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 34 [2025-03-17 11:57:53,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:53,297 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 159 treesize of output 136 [2025-03-17 11:57:53,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:53,303 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 84 treesize of output 75 [2025-03-17 11:57:53,307 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 66 treesize of output 62 [2025-03-17 11:57:53,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:53,495 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 34 treesize of output 52 [2025-03-17 11:57:53,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:53,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956244553] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:57:53,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:57:53,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 15] total 35 [2025-03-17 11:57:53,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194538649] [2025-03-17 11:57:53,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:57:53,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-17 11:57:53,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:53,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-17 11:57:53,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=878, Unknown=11, NotChecked=186, Total=1190 [2025-03-17 11:57:53,527 INFO L87 Difference]: Start difference. First operand 450 states and 588 transitions. Second operand has 35 states, 35 states have (on average 3.085714285714286) internal successors, (108), 35 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:54,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:57:54,439 INFO L93 Difference]: Finished difference Result 548 states and 695 transitions. [2025-03-17 11:57:54,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 11:57:54,439 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.085714285714286) internal successors, (108), 35 states have internal predecessors, (108), 0 states have call successors, (0), 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-03-17 11:57:54,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:57:54,441 INFO L225 Difference]: With dead ends: 548 [2025-03-17 11:57:54,441 INFO L226 Difference]: Without dead ends: 548 [2025-03-17 11:57:54,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=328, Invalid=1743, Unknown=11, NotChecked=270, Total=2352 [2025-03-17 11:57:54,442 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 747 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 1751 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 2641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 849 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 11:57:54,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 1554 Invalid, 2641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1751 Invalid, 0 Unknown, 849 Unchecked, 0.6s Time] [2025-03-17 11:57:54,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-17 11:57:54,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 450. [2025-03-17 11:57:54,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 428 states have (on average 1.3714953271028036) internal successors, (587), 449 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 587 transitions. [2025-03-17 11:57:54,447 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 587 transitions. Word has length 41 [2025-03-17 11:57:54,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:57:54,447 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 587 transitions. [2025-03-17 11:57:54,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.085714285714286) internal successors, (108), 35 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:57:54,448 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 587 transitions. [2025-03-17 11:57:54,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 11:57:54,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:57:54,450 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:57:54,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 11:57:54,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-17 11:57:54,654 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-03-17 11:57:54,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:57:54,654 INFO L85 PathProgramCache]: Analyzing trace with hash -926796045, now seen corresponding path program 1 times [2025-03-17 11:57:54,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:57:54,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717854772] [2025-03-17 11:57:54,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:54,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:57:54,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 11:57:54,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 11:57:54,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:54,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:55,542 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:55,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:57:55,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717854772] [2025-03-17 11:57:55,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717854772] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:57:55,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791286380] [2025-03-17 11:57:55,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:57:55,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:57:55,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:57:55,544 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:57:55,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 11:57:55,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 11:57:55,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 11:57:55,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:57:55,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:57:55,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-17 11:57:55,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:57:55,716 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:57:55,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:57:55,739 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-03-17 11:57:55,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:57:55,805 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:57:55,805 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-03-17 11:57:55,811 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-03-17 11:57:55,879 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:57:55,879 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-03-17 11:57:55,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-17 11:57:55,959 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-03-17 11:57:55,962 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-03-17 11:57:56,002 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:56,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:57:56,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:56,202 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 107 treesize of output 155 [2025-03-17 11:57:56,347 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| 1)) (.cse3 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) (and (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1220))) (let ((.cse0 (select (select (store .cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1221) |c_ULTIMATE.start_main_~n~0#1.base|) .cse3) v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (< .cse0 .cse1) (< .cse0 (+ 5 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse3))))))) (forall ((v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1221))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~n~0#1.base|) .cse3))) (or (= .cse5 |c_ULTIMATE.start_main_#t~mem21#1.base|) (= (select (select (store .cse6 .cse5 v_ArrVal_1222) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) |c_ULTIMATE.start_main_#t~mem21#1.base|) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1220) .cse5 v_ArrVal_1223) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))))))) (forall ((v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1221))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~n~0#1.base|) .cse3))) (let ((.cse7 (select (select (store .cse9 .cse8 v_ArrVal_1222) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))) (or (= .cse7 |c_ULTIMATE.start_main_#t~mem21#1.base|) (= .cse8 .cse7)))))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1221))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~n~0#1.base|) .cse3))) (or (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1220) .cse10 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) .cse1) (= .cse10 |c_ULTIMATE.start_main_#t~mem21#1.base|) (= .cse10 (select (select (store .cse11 .cse10 v_ArrVal_1222) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4)))))) (forall ((v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1221))) (let ((.cse12 (select (select .cse14 |c_ULTIMATE.start_main_~n~0#1.base|) .cse3))) (or (= .cse12 |c_ULTIMATE.start_main_#t~mem21#1.base|) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1220))) (< (select (select (store .cse13 .cse12 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) (+ 5 (select (select .cse13 |c_ULTIMATE.start_main_~n~0#1.base|) .cse3))))) (= (select (select (store .cse14 .cse12 v_ArrVal_1222) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) |c_ULTIMATE.start_main_#t~mem21#1.base|))))) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1221))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~n~0#1.base|) .cse3))) (or (= .cse15 |c_ULTIMATE.start_main_#t~mem21#1.base|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1220) .cse15 v_ArrVal_1223) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4) 1)) (= .cse15 (select (select (store .cse16 .cse15 v_ArrVal_1222) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4)))))) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1220) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1221) |c_ULTIMATE.start_main_~n~0#1.base|) .cse3) v_ArrVal_1223) |c_ULTIMATE.start_main_~root~0#1.base|) .cse4))))) is different from false [2025-03-17 11:57:56,404 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse14 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse4) 1)) (.cse2 (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse4))) (and (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1221))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse4))) (or (= (select (select (store .cse0 .cse1 v_ArrVal_1222) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) .cse1) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1220) .cse1 v_ArrVal_1223) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) 1)) (= .cse3 .cse1))))) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1221))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~n~0#1.base|) .cse4))) (or (= .cse3 (select (select (store .cse5 .cse6 v_ArrVal_1222) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1220) .cse6 v_ArrVal_1223) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) 1)) (= .cse3 .cse6))))) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1220) (select (select (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1221) |c_ULTIMATE.start_main_~n~0#1.base|) .cse4) v_ArrVal_1223) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1221))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~n~0#1.base|) .cse4))) (or (= .cse3 (select (select (store .cse7 .cse8 v_ArrVal_1222) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)) (let ((.cse9 (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1220))) (< (select (select (store .cse9 .cse8 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) (+ 5 (select (select .cse9 |c_ULTIMATE.start_main_~n~0#1.base|) .cse4)))) (= .cse3 .cse8))))) (forall ((v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1221))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~n~0#1.base|) .cse4))) (let ((.cse10 (select (select (store .cse12 .cse11 v_ArrVal_1222) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))) (or (= .cse3 .cse10) (= .cse10 .cse11)))))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1221))) (let ((.cse13 (select (select .cse15 |c_ULTIMATE.start_main_~n~0#1.base|) .cse4))) (or (< (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1220) .cse13 v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) .cse14) (= (select (select (store .cse15 .cse13 v_ArrVal_1222) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) .cse13) (= .cse3 .cse13))))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1220))) (let ((.cse16 (select (select (store .cse17 (select (select (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1221) |c_ULTIMATE.start_main_~n~0#1.base|) .cse4) v_prenex_9) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))) (or (< .cse16 .cse14) (< .cse16 (+ 5 (select (select .cse17 |c_ULTIMATE.start_main_~n~0#1.base|) .cse4)))))))))) is different from false [2025-03-17 11:57:56,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:56,465 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 65 treesize of output 56 [2025-03-17 11:57:56,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:56,470 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 112 treesize of output 82 [2025-03-17 11:57:56,476 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-03-17 11:57:56,476 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 258 treesize of output 210 [2025-03-17 11:57:56,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:57:56,490 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-03-17 11:57:56,490 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 212 treesize of output 194 [2025-03-17 11:57:56,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2025-03-17 11:57:56,501 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 44 treesize of output 36 [2025-03-17 11:57:56,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:56,509 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-03-17 11:57:56,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:56,517 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 126 treesize of output 102 [2025-03-17 11:57:56,565 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 11:57:56,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:56,570 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 112 treesize of output 92 [2025-03-17 11:57:56,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:56,574 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 82 treesize of output 72 [2025-03-17 11:57:56,578 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 135 treesize of output 117 [2025-03-17 11:57:56,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:56,596 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 439 treesize of output 372 [2025-03-17 11:57:56,602 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 227 treesize of output 203 [2025-03-17 11:57:56,606 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 157 treesize of output 125 [2025-03-17 11:57:56,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:56,615 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 125 treesize of output 109 [2025-03-17 11:57:56,672 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 11:57:56,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:56,676 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 44 treesize of output 45 [2025-03-17 11:57:56,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:56,680 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 37 [2025-03-17 11:57:56,682 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:57:56,683 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 34 treesize of output 22 [2025-03-17 11:57:56,685 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:57:56,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:57:56,686 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 22 treesize of output 10 [2025-03-17 11:57:56,691 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-17 11:57:56,691 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 108 treesize of output 1 [2025-03-17 11:57:56,694 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 11:57:56,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:57:56,812 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-03-17 11:57:56,842 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:57:56,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791286380] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:57:56,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:57:56,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 12, 12] total 45 [2025-03-17 11:57:56,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807343617] [2025-03-17 11:57:56,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:57:56,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-17 11:57:56,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:57:56,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-17 11:57:56,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1702, Unknown=2, NotChecked=170, Total=2070 [2025-03-17 11:57:56,843 INFO L87 Difference]: Start difference. First operand 450 states and 587 transitions. Second operand has 46 states, 45 states have (on average 2.7111111111111112) internal successors, (122), 46 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:04,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:04,924 INFO L93 Difference]: Finished difference Result 1833 states and 2301 transitions. [2025-03-17 11:58:04,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2025-03-17 11:58:04,925 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.7111111111111112) internal successors, (122), 46 states have internal predecessors, (122), 0 states have call successors, (0), 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 45 [2025-03-17 11:58:04,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:04,928 INFO L225 Difference]: With dead ends: 1833 [2025-03-17 11:58:04,928 INFO L226 Difference]: Without dead ends: 1833 [2025-03-17 11:58:04,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 186 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 12556 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=5484, Invalid=28932, Unknown=2, NotChecked=738, Total=35156 [2025-03-17 11:58:04,935 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 2271 mSDsluCounter, 3391 mSDsCounter, 0 mSdLazyCounter, 5107 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2271 SdHoareTripleChecker+Valid, 3540 SdHoareTripleChecker+Invalid, 8005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 5107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2535 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:04,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2271 Valid, 3540 Invalid, 8005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 5107 Invalid, 0 Unknown, 2535 Unchecked, 2.3s Time] [2025-03-17 11:58:04,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2025-03-17 11:58:04,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 811. [2025-03-17 11:58:04,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 789 states have (on average 1.3840304182509506) internal successors, (1092), 810 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:04,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1092 transitions. [2025-03-17 11:58:04,965 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1092 transitions. Word has length 45 [2025-03-17 11:58:04,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:04,965 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1092 transitions. [2025-03-17 11:58:04,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.7111111111111112) internal successors, (122), 46 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:04,965 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1092 transitions. [2025-03-17 11:58:04,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 11:58:04,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:04,967 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:04,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 11:58:05,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-17 11:58:05,168 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-03-17 11:58:05,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:05,168 INFO L85 PathProgramCache]: Analyzing trace with hash -926949961, now seen corresponding path program 1 times [2025-03-17 11:58:05,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:05,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609036942] [2025-03-17 11:58:05,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:05,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:05,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 11:58:05,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 11:58:05,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:05,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:05,591 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:05,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:05,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609036942] [2025-03-17 11:58:05,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609036942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:58:05,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864476399] [2025-03-17 11:58:05,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:05,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:58:05,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:58:05,593 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:58:05,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 11:58:05,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 11:58:05,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 11:58:05,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:05,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:05,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-17 11:58:05,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:58:05,760 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:58:05,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:58:05,776 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-03-17 11:58:05,824 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 11:58:05,824 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-03-17 11:58:05,867 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 11:58:05,868 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-03-17 11:58:05,917 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2025-03-17 11:58:05,917 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-03-17 11:58:05,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:58:05,956 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-03-17 11:58:06,047 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:58:06,047 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-03-17 11:58:06,110 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:58:06,110 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-03-17 11:58:06,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:58:06,214 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-03-17 11:58:06,250 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:06,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:58:06,271 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1340 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1340) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) is different from false [2025-03-17 11:58:06,274 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1340 (Array Int Int))) (= 1 (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_1340) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))) is different from false [2025-03-17 11:58:06,310 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1339 (Array Int Int)) (v_ArrVal_1340 (Array Int Int))) (= 1 (select |c_#valid| (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1339))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1340))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))) is different from false [2025-03-17 11:58:06,316 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1339 (Array Int Int)) (v_ArrVal_1340 (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_1339))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1340))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) is different from false [2025-03-17 11:58:06,637 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:58:06,668 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-03-17 11:58:06,669 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 108518 treesize of output 95616 [2025-03-17 11:58:06,953 INFO L349 Elim1Store]: treesize reduction 18, result has 95.7 percent of original size [2025-03-17 11:58:06,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 842 treesize of output 1096 [2025-03-17 11:58:07,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:58:07,043 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 2891 treesize of output 2729 [2025-03-17 11:58:07,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:58:07,130 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 2005 treesize of output 1885 [2025-03-17 11:58:07,239 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 1786 treesize of output 1700 [2025-03-17 11:58:07,354 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 478 treesize of output 420 [2025-03-17 11:58:07,406 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-03-17 11:58:47,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:58:47,657 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 72 [2025-03-17 11:58:47,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:58:47,790 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-03-17 11:58:47,872 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:47,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864476399] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:58:47,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:58:47,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 18] total 40 [2025-03-17 11:58:47,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81438316] [2025-03-17 11:58:47,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:58:47,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-17 11:58:47,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:47,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-17 11:58:47,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1077, Unknown=33, NotChecked=292, Total=1640 [2025-03-17 11:58:47,873 INFO L87 Difference]: Start difference. First operand 811 states and 1092 transitions. Second operand has 41 states, 40 states have (on average 2.725) internal successors, (109), 41 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:49,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:49,648 INFO L93 Difference]: Finished difference Result 1799 states and 2388 transitions. [2025-03-17 11:58:49,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-17 11:58:49,648 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.725) internal successors, (109), 41 states have internal predecessors, (109), 0 states have call successors, (0), 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 45 [2025-03-17 11:58:49,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:49,652 INFO L225 Difference]: With dead ends: 1799 [2025-03-17 11:58:49,652 INFO L226 Difference]: Without dead ends: 1799 [2025-03-17 11:58:49,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 73 SyntacticMatches, 8 SemanticMatches, 64 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=739, Invalid=3005, Unknown=54, NotChecked=492, Total=4290 [2025-03-17 11:58:49,653 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 1046 mSDsluCounter, 1747 mSDsCounter, 0 mSdLazyCounter, 2049 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 4708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 2049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2567 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:49,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 1852 Invalid, 4708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 2049 Invalid, 0 Unknown, 2567 Unchecked, 1.2s Time] [2025-03-17 11:58:49,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2025-03-17 11:58:49,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 989. [2025-03-17 11:58:49,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 967 states have (on average 1.3877973112719753) internal successors, (1342), 988 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:49,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1342 transitions. [2025-03-17 11:58:49,665 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1342 transitions. Word has length 45 [2025-03-17 11:58:49,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:49,665 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1342 transitions. [2025-03-17 11:58:49,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.725) internal successors, (109), 41 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:49,666 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1342 transitions. [2025-03-17 11:58:49,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 11:58:49,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:49,667 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:49,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-17 11:58:49,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-17 11:58:49,871 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-03-17 11:58:49,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:49,871 INFO L85 PathProgramCache]: Analyzing trace with hash -926949960, now seen corresponding path program 1 times [2025-03-17 11:58:49,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:49,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232367652] [2025-03-17 11:58:49,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:49,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:49,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 11:58:49,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 11:58:49,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:49,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:50,413 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:50,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:50,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232367652] [2025-03-17 11:58:50,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232367652] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:58:50,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641342722] [2025-03-17 11:58:50,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:50,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:58:50,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:58:50,430 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:58:50,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 11:58:50,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 11:58:50,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 11:58:50,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:50,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:50,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-17 11:58:50,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:58:50,611 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:58:50,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:58:50,617 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-03-17 11:58:50,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:58:50,652 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-03-17 11:58:50,724 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 11:58:50,724 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-03-17 11:58:50,727 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-03-17 11:58:50,797 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 11:58:50,797 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 59 treesize of output 52 [2025-03-17 11:58:50,805 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-03-17 11:58:50,892 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-17 11:58:50,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2025-03-17 11:58:50,912 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-03-17 11:58:50,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-03-17 11:58:50,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:58:50,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 11:58:50,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:58:50,948 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-03-17 11:58:51,026 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:58:51,026 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 82 treesize of output 71 [2025-03-17 11:58:51,034 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 28 treesize of output 11 [2025-03-17 11:58:51,086 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:58:51,087 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 82 treesize of output 71 [2025-03-17 11:58:51,095 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 28 treesize of output 11 [2025-03-17 11:58:51,195 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 21 [2025-03-17 11:58:51,198 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-03-17 11:58:51,238 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:51,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:58:51,334 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1465 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1465) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1465) |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~mem22#1.base| v_ArrVal_1464) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))) is different from false [2025-03-17 11:58:51,339 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)))) (and (forall ((v_ArrVal_1465 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1465) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1465) |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| .cse0 v_ArrVal_1464) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))))) is different from false [2025-03-17 11:58:51,348 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1462) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1463) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1465) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1463))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1462) .cse1 v_ArrVal_1465) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 4) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1464) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))))))) is different from false [2025-03-17 11:58:51,354 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |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|) .cse1))) (and (forall ((v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1462) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1463) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1465) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1463))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1462) .cse2 v_ArrVal_1465) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 4) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1464) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))))))) is different from false [2025-03-17 11:58:52,186 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-03-17 11:58:52,187 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 478795 treesize of output 476374 [2025-03-17 11:58:52,294 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-03-17 11:58:52,295 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 383993 treesize of output 349860 [2025-03-17 11:58:52,543 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 2667 treesize of output 2619 [2025-03-17 11:58:52,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:58:52,578 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 4692 treesize of output 4516 [2025-03-17 11:58:52,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:58:52,644 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 3749 treesize of output 3600 [2025-03-17 11:58:52,680 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 3837 treesize of output 3817 [2025-03-17 11:58:52,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:58:52,727 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 3941 treesize of output 3818 [2025-03-17 11:58:52,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:58:52,779 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 7704 treesize of output 7604 [2025-03-17 11:58:52,904 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 4249 treesize of output 4193 [2025-03-17 11:58:52,987 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 4057 treesize of output 4029 [2025-03-17 11:58:53,049 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 3857 treesize of output 3809 [2025-03-17 11:58:53,091 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 3809 treesize of output 3793 [2025-03-17 11:58:53,249 INFO L349 Elim1Store]: treesize reduction 6, result has 95.7 percent of original size [2025-03-17 11:58:53,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 3800 treesize of output 3914 [2025-03-17 11:58:53,499 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 3851 treesize of output 3831 [2025-03-17 11:58:53,555 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 3884 treesize of output 3842 [2025-03-17 11:58:53,611 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 3847 treesize of output 3837 [2025-03-17 11:58:53,667 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 3837 treesize of output 3709 [2025-03-17 11:58:53,734 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 3709 treesize of output 3677 [2025-03-17 11:58:53,838 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 3677 treesize of output 3661