./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0513.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 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/test-0513.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 aaec9a71c2206d3d9fbfa56b3c6172e3ff60aad385f0ad346fdbde53f8ce1a2e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:37:59,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:37:59,549 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:37:59,553 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:37:59,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:37:59,576 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:37:59,578 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:37:59,578 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:37:59,578 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:37:59,579 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:37:59,579 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:37:59,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:37:59,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:37:59,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:37:59,580 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:37:59,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:37:59,580 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:37:59,580 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:37:59,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:37:59,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:37:59,580 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:37:59,581 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:37:59,581 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:37:59,581 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:37:59,581 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:37:59,581 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:37:59,581 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:37:59,581 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:37:59,581 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:37:59,581 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:37:59,581 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:37:59,582 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:37:59,582 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:37:59,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:37:59,582 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:37:59,582 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:37:59,582 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:37:59,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:37:59,582 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:37:59,582 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:37:59,583 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:37:59,583 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:37:59,583 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 -> aaec9a71c2206d3d9fbfa56b3c6172e3ff60aad385f0ad346fdbde53f8ce1a2e [2025-03-04 07:37:59,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:37:59,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:37:59,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:37:59,794 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:37:59,794 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:37:59,796 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0513.i [2025-03-04 07:38:00,912 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08a25ae63/50670ab20fd249e792de877c138d37ec/FLAG4ebdf11c6 [2025-03-04 07:38:01,159 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:38:01,160 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0513.i [2025-03-04 07:38:01,167 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08a25ae63/50670ab20fd249e792de877c138d37ec/FLAG4ebdf11c6 [2025-03-04 07:38:01,484 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08a25ae63/50670ab20fd249e792de877c138d37ec [2025-03-04 07:38:01,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:38:01,487 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:38:01,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:38:01,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:38:01,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:38:01,492 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:38:01" (1/1) ... [2025-03-04 07:38:01,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22e0ef6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:38:01, skipping insertion in model container [2025-03-04 07:38:01,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:38:01" (1/1) ... [2025-03-04 07:38:01,517 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:38:01,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:38:01,749 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:38:01,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:38:01,812 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:38:01,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:38:01 WrapperNode [2025-03-04 07:38:01,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:38:01,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:38:01,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:38:01,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:38:01,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:38:01" (1/1) ... [2025-03-04 07:38:01,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:38:01" (1/1) ... [2025-03-04 07:38:01,837 INFO L138 Inliner]: procedures = 123, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 118 [2025-03-04 07:38:01,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:38:01,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:38:01,838 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:38:01,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:38:01,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:38:01" (1/1) ... [2025-03-04 07:38:01,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:38:01" (1/1) ... [2025-03-04 07:38:01,851 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:38:01" (1/1) ... [2025-03-04 07:38:01,866 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 11 writes are split as follows [0, 11]. [2025-03-04 07:38:01,866 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:38:01" (1/1) ... [2025-03-04 07:38:01,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:38:01" (1/1) ... [2025-03-04 07:38:01,872 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:38:01" (1/1) ... [2025-03-04 07:38:01,873 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:38:01" (1/1) ... [2025-03-04 07:38:01,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:38:01" (1/1) ... [2025-03-04 07:38:01,874 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:38:01" (1/1) ... [2025-03-04 07:38:01,875 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:38:01,877 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:38:01,877 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:38:01,877 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:38:01,878 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:38:01" (1/1) ... [2025-03-04 07:38:01,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:38:01,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:38:01,900 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-04 07:38:01,901 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-04 07:38:01,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:38:01,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:38:01,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:38:01,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:38:01,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:38:01,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:38:01,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:38:01,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:38:01,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:38:01,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:38:01,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:38:01,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:38:01,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:38:01,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:38:01,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:38:01,997 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:38:01,999 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:38:02,274 INFO L? ?]: Removed 146 outVars from TransFormulas that were not future-live. [2025-03-04 07:38:02,275 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:38:02,285 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:38:02,286 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:38:02,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:38:02 BoogieIcfgContainer [2025-03-04 07:38:02,286 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:38:02,289 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:38:02,289 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:38:02,292 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:38:02,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:38:01" (1/3) ... [2025-03-04 07:38:02,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d50cb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:38:02, skipping insertion in model container [2025-03-04 07:38:02,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:38:01" (2/3) ... [2025-03-04 07:38:02,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d50cb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:38:02, skipping insertion in model container [2025-03-04 07:38:02,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:38:02" (3/3) ... [2025-03-04 07:38:02,296 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0513.i [2025-03-04 07:38:02,307 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:38:02,308 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0513.i that has 1 procedures, 131 locations, 1 initial locations, 4 loop locations, and 62 error locations. [2025-03-04 07:38:02,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:38:02,352 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;@1c1a1fcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:38:02,352 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2025-03-04 07:38:02,356 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 68 states have (on average 2.088235294117647) internal successors, (142), 130 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:02,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:38:02,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:02,361 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:38:02,362 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:38:02,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:02,366 INFO L85 PathProgramCache]: Analyzing trace with hash 166016006, now seen corresponding path program 1 times [2025-03-04 07:38:02,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:02,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594361811] [2025-03-04 07:38:02,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:02,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:02,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:38:02,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:38:02,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:02,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:02,464 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-04 07:38:02,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:02,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594361811] [2025-03-04 07:38:02,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594361811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:38:02,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:38:02,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:38:02,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762103191] [2025-03-04 07:38:02,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:02,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 07:38:02,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:02,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 07:38:02,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 07:38:02,491 INFO L87 Difference]: Start difference. First operand has 131 states, 68 states have (on average 2.088235294117647) internal successors, (142), 130 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 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-04 07:38:02,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:02,501 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2025-03-04 07:38:02,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 07:38:02,503 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2025-03-04 07:38:02,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:02,508 INFO L225 Difference]: With dead ends: 131 [2025-03-04 07:38:02,508 INFO L226 Difference]: Without dead ends: 129 [2025-03-04 07:38:02,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 07:38:02,511 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:02,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:38:02,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-04 07:38:02,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-03-04 07:38:02,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 67 states have (on average 2.044776119402985) internal successors, (137), 128 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-04 07:38:02,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2025-03-04 07:38:02,537 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 5 [2025-03-04 07:38:02,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:02,537 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2025-03-04 07:38:02,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 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-04 07:38:02,537 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2025-03-04 07:38:02,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:38:02,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:02,537 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:38:02,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:38:02,538 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:38:02,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:02,538 INFO L85 PathProgramCache]: Analyzing trace with hash 851534998, now seen corresponding path program 1 times [2025-03-04 07:38:02,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:02,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602395976] [2025-03-04 07:38:02,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:02,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:02,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:38:02,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:38:02,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:02,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:02,570 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-04 07:38:02,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:02,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602395976] [2025-03-04 07:38:02,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602395976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:38:02,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:38:02,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:38:02,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044945622] [2025-03-04 07:38:02,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:02,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:38:02,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:02,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:38:02,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:38:02,572 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand has 3 states, 2 states have (on average 3.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-04 07:38:02,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:02,682 INFO L93 Difference]: Finished difference Result 175 states and 185 transitions. [2025-03-04 07:38:02,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:38:02,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.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-04 07:38:02,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:02,683 INFO L225 Difference]: With dead ends: 175 [2025-03-04 07:38:02,684 INFO L226 Difference]: Without dead ends: 174 [2025-03-04 07:38:02,684 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-04 07:38:02,684 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 42 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:02,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 190 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:38:02,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-04 07:38:02,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 132. [2025-03-04 07:38:02,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 70 states have (on average 2.0142857142857142) internal successors, (141), 131 states have internal predecessors, (141), 0 states have call successors, (0), 0 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-04 07:38:02,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2025-03-04 07:38:02,691 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 6 [2025-03-04 07:38:02,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:02,691 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2025-03-04 07:38:02,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.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-04 07:38:02,691 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2025-03-04 07:38:02,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:38:02,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:02,692 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:38:02,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:38:02,692 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:38:02,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:02,692 INFO L85 PathProgramCache]: Analyzing trace with hash 851535129, now seen corresponding path program 1 times [2025-03-04 07:38:02,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:02,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061152624] [2025-03-04 07:38:02,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:02,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:02,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:38:02,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:38:02,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:02,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:02,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-04 07:38:02,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:02,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061152624] [2025-03-04 07:38:02,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061152624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:38:02,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:38:02,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:38:02,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787411081] [2025-03-04 07:38:02,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:02,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:38:02,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:02,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:38:02,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:38:02,744 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 3 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-04 07:38:02,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:02,801 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2025-03-04 07:38:02,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:38:02,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 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-04 07:38:02,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:02,802 INFO L225 Difference]: With dead ends: 142 [2025-03-04 07:38:02,804 INFO L226 Difference]: Without dead ends: 141 [2025-03-04 07:38:02,804 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-04 07:38:02,804 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 10 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:02,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 230 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:38:02,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-04 07:38:02,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2025-03-04 07:38:02,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 75 states have (on average 1.9866666666666666) internal successors, (149), 136 states have internal predecessors, (149), 0 states have call successors, (0), 0 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-04 07:38:02,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2025-03-04 07:38:02,814 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 6 [2025-03-04 07:38:02,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:02,815 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2025-03-04 07:38:02,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-04 07:38:02,815 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2025-03-04 07:38:02,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:38:02,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:02,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:38:02,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:38:02,817 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:38:02,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:02,817 INFO L85 PathProgramCache]: Analyzing trace with hash 851537052, now seen corresponding path program 1 times [2025-03-04 07:38:02,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:02,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585399860] [2025-03-04 07:38:02,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:02,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:02,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:38:02,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:38:02,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:02,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:02,878 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-04 07:38:02,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:02,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585399860] [2025-03-04 07:38:02,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585399860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:38:02,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:38:02,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:38:02,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342708900] [2025-03-04 07:38:02,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:02,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:38:02,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:02,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:38:02,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:38:02,880 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand has 3 states, 2 states have (on average 3.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-04 07:38:02,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:02,980 INFO L93 Difference]: Finished difference Result 144 states and 157 transitions. [2025-03-04 07:38:02,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:38:02,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.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-04 07:38:02,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:02,981 INFO L225 Difference]: With dead ends: 144 [2025-03-04 07:38:02,982 INFO L226 Difference]: Without dead ends: 144 [2025-03-04 07:38:02,983 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-04 07:38:02,983 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 45 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:02,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 152 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:38:02,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-04 07:38:02,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2025-03-04 07:38:02,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 79 states have (on average 1.9240506329113924) internal successors, (152), 137 states have internal predecessors, (152), 0 states have call successors, (0), 0 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-04 07:38:02,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2025-03-04 07:38:02,988 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 6 [2025-03-04 07:38:02,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:02,988 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2025-03-04 07:38:02,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.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-04 07:38:02,988 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2025-03-04 07:38:02,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:38:02,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:02,989 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:38:02,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:38:02,989 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:38:02,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:02,989 INFO L85 PathProgramCache]: Analyzing trace with hash 851537053, now seen corresponding path program 1 times [2025-03-04 07:38:02,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:02,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635448900] [2025-03-04 07:38:02,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:02,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:02,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:38:03,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:38:03,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:03,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:03,047 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-04 07:38:03,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:03,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635448900] [2025-03-04 07:38:03,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635448900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:38:03,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:38:03,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:38:03,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126203872] [2025-03-04 07:38:03,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:03,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:38:03,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:03,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:38:03,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:38:03,049 INFO L87 Difference]: Start difference. First operand 138 states and 152 transitions. Second operand has 3 states, 2 states have (on average 3.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-04 07:38:03,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:03,117 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2025-03-04 07:38:03,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:38:03,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.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-04 07:38:03,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:03,118 INFO L225 Difference]: With dead ends: 136 [2025-03-04 07:38:03,118 INFO L226 Difference]: Without dead ends: 136 [2025-03-04 07:38:03,119 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-04 07:38:03,119 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 21 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:03,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 173 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:38:03,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-04 07:38:03,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-04 07:38:03,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 79 states have (on average 1.8734177215189873) internal successors, (148), 135 states have internal predecessors, (148), 0 states have call successors, (0), 0 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-04 07:38:03,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2025-03-04 07:38:03,123 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 6 [2025-03-04 07:38:03,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:03,123 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2025-03-04 07:38:03,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.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-04 07:38:03,124 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2025-03-04 07:38:03,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:38:03,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:03,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:38:03,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:38:03,124 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:38:03,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:03,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1187815612, now seen corresponding path program 1 times [2025-03-04 07:38:03,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:03,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987112949] [2025-03-04 07:38:03,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:03,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:03,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:38:03,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:38:03,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:03,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:03,191 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-04 07:38:03,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:03,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987112949] [2025-03-04 07:38:03,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987112949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:38:03,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:38:03,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:38:03,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960794636] [2025-03-04 07:38:03,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:03,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:38:03,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:03,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:38:03,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:38:03,192 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 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-04 07:38:03,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:03,254 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2025-03-04 07:38:03,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:38:03,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2025-03-04 07:38:03,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:03,255 INFO L225 Difference]: With dead ends: 132 [2025-03-04 07:38:03,255 INFO L226 Difference]: Without dead ends: 132 [2025-03-04 07:38:03,255 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-04 07:38:03,255 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 18 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:03,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 167 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:38:03,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-04 07:38:03,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-03-04 07:38:03,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 79 states have (on average 1.8227848101265822) internal successors, (144), 131 states have internal predecessors, (144), 0 states have call successors, (0), 0 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-04 07:38:03,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2025-03-04 07:38:03,264 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 11 [2025-03-04 07:38:03,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:03,264 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2025-03-04 07:38:03,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 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-04 07:38:03,264 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2025-03-04 07:38:03,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:38:03,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:03,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:38:03,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:38:03,265 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:38:03,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:03,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1187815611, now seen corresponding path program 1 times [2025-03-04 07:38:03,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:03,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708638265] [2025-03-04 07:38:03,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:03,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:03,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:38:03,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:38:03,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:03,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:03,368 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-04 07:38:03,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:03,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708638265] [2025-03-04 07:38:03,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708638265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:38:03,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:38:03,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:38:03,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312941114] [2025-03-04 07:38:03,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:03,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:38:03,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:03,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:38:03,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:38:03,370 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 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-04 07:38:03,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:03,444 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2025-03-04 07:38:03,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:38:03,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2025-03-04 07:38:03,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:03,444 INFO L225 Difference]: With dead ends: 129 [2025-03-04 07:38:03,444 INFO L226 Difference]: Without dead ends: 129 [2025-03-04 07:38:03,445 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-04 07:38:03,445 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 11 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:03,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 178 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:38:03,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-04 07:38:03,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-03-04 07:38:03,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 79 states have (on average 1.7848101265822784) internal successors, (141), 128 states have internal predecessors, (141), 0 states have call successors, (0), 0 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-04 07:38:03,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 141 transitions. [2025-03-04 07:38:03,448 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 141 transitions. Word has length 11 [2025-03-04 07:38:03,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:03,448 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 141 transitions. [2025-03-04 07:38:03,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 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-04 07:38:03,449 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 141 transitions. [2025-03-04 07:38:03,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 07:38:03,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:03,449 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:38:03,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:38:03,449 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:38:03,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:03,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1773804053, now seen corresponding path program 1 times [2025-03-04 07:38:03,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:03,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667479746] [2025-03-04 07:38:03,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:03,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:03,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 07:38:03,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:38:03,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:03,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:03,527 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-04 07:38:03,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:03,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667479746] [2025-03-04 07:38:03,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667479746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:38:03,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:38:03,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:38:03,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426689419] [2025-03-04 07:38:03,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:03,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:38:03,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:03,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:38:03,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:38:03,529 INFO L87 Difference]: Start difference. First operand 129 states and 141 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-04 07:38:03,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:03,619 INFO L93 Difference]: Finished difference Result 198 states and 233 transitions. [2025-03-04 07:38:03,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:38:03,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-04 07:38:03,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:03,620 INFO L225 Difference]: With dead ends: 198 [2025-03-04 07:38:03,620 INFO L226 Difference]: Without dead ends: 198 [2025-03-04 07:38:03,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:38:03,621 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 89 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:03,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 250 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:38:03,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-04 07:38:03,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 129. [2025-03-04 07:38:03,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 79 states have (on average 1.759493670886076) internal successors, (139), 128 states have internal predecessors, (139), 0 states have call successors, (0), 0 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-04 07:38:03,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2025-03-04 07:38:03,630 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 18 [2025-03-04 07:38:03,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:03,630 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2025-03-04 07:38:03,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-04 07:38:03,630 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2025-03-04 07:38:03,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 07:38:03,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:03,631 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:38:03,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:38:03,631 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:38:03,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:03,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1773803922, now seen corresponding path program 1 times [2025-03-04 07:38:03,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:03,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032263654] [2025-03-04 07:38:03,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:03,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:03,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 07:38:03,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:38:03,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:03,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:03,702 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-04 07:38:03,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:03,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032263654] [2025-03-04 07:38:03,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032263654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:38:03,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:38:03,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:38:03,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537136058] [2025-03-04 07:38:03,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:03,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:38:03,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:03,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:38:03,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:38:03,704 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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-04 07:38:03,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:03,834 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2025-03-04 07:38:03,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:38:03,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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-04 07:38:03,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:03,834 INFO L225 Difference]: With dead ends: 122 [2025-03-04 07:38:03,835 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 07:38:03,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:38:03,835 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 38 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:03,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 211 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:38:03,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 07:38:03,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-04 07:38:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 80 states have (on average 1.6625) internal successors, (133), 121 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:03,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2025-03-04 07:38:03,838 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 18 [2025-03-04 07:38:03,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:03,838 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2025-03-04 07:38:03,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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-04 07:38:03,838 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2025-03-04 07:38:03,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 07:38:03,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:03,839 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:38:03,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:38:03,839 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:38:03,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:03,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1773803921, now seen corresponding path program 1 times [2025-03-04 07:38:03,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:03,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650373223] [2025-03-04 07:38:03,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:03,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:03,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 07:38:03,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:38:03,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:03,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:03,960 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-04 07:38:03,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:03,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650373223] [2025-03-04 07:38:03,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650373223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:38:03,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:38:03,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:38:03,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500744217] [2025-03-04 07:38:03,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:03,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:38:03,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:03,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:38:03,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:38:03,961 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:04,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:04,102 INFO L93 Difference]: Finished difference Result 184 states and 204 transitions. [2025-03-04 07:38:04,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:38:04,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-04 07:38:04,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:04,103 INFO L225 Difference]: With dead ends: 184 [2025-03-04 07:38:04,103 INFO L226 Difference]: Without dead ends: 184 [2025-03-04 07:38:04,104 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-04 07:38:04,104 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 79 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:04,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 174 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:38:04,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-04 07:38:04,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 161. [2025-03-04 07:38:04,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 121 states have (on average 1.6859504132231404) internal successors, (204), 160 states have internal predecessors, (204), 0 states have call successors, (0), 0 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-04 07:38:04,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 204 transitions. [2025-03-04 07:38:04,107 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 204 transitions. Word has length 18 [2025-03-04 07:38:04,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:04,107 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 204 transitions. [2025-03-04 07:38:04,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:04,107 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 204 transitions. [2025-03-04 07:38:04,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 07:38:04,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:04,108 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] [2025-03-04 07:38:04,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:38:04,108 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:38:04,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:04,109 INFO L85 PathProgramCache]: Analyzing trace with hash -955535214, now seen corresponding path program 1 times [2025-03-04 07:38:04,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:04,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529233965] [2025-03-04 07:38:04,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:04,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:04,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:38:04,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:38:04,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:04,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:04,231 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-04 07:38:04,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:04,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529233965] [2025-03-04 07:38:04,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529233965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:38:04,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:38:04,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:38:04,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215581793] [2025-03-04 07:38:04,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:04,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:38:04,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:04,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:38:04,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:38:04,234 INFO L87 Difference]: Start difference. First operand 161 states and 204 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:04,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:04,394 INFO L93 Difference]: Finished difference Result 185 states and 230 transitions. [2025-03-04 07:38:04,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:38:04,394 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-04 07:38:04,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:04,396 INFO L225 Difference]: With dead ends: 185 [2025-03-04 07:38:04,396 INFO L226 Difference]: Without dead ends: 185 [2025-03-04 07:38:04,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:38:04,397 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 17 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:04,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 412 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:38:04,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-04 07:38:04,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2025-03-04 07:38:04,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 132 states have (on average 1.6515151515151516) internal successors, (218), 171 states have internal predecessors, (218), 0 states have call successors, (0), 0 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-04 07:38:04,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 218 transitions. [2025-03-04 07:38:04,401 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 218 transitions. Word has length 23 [2025-03-04 07:38:04,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:04,401 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 218 transitions. [2025-03-04 07:38:04,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:04,401 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 218 transitions. [2025-03-04 07:38:04,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 07:38:04,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:04,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] [2025-03-04 07:38:04,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:38:04,403 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:38:04,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:04,404 INFO L85 PathProgramCache]: Analyzing trace with hash -955535213, now seen corresponding path program 1 times [2025-03-04 07:38:04,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:04,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219970499] [2025-03-04 07:38:04,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:04,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:04,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:38:04,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:38:04,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:04,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:04,608 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-04 07:38:04,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:04,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219970499] [2025-03-04 07:38:04,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219970499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:38:04,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:38:04,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:38:04,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43812934] [2025-03-04 07:38:04,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:04,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:38:04,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:04,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:38:04,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:38:04,609 INFO L87 Difference]: Start difference. First operand 172 states and 218 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:04,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:04,723 INFO L93 Difference]: Finished difference Result 173 states and 217 transitions. [2025-03-04 07:38:04,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:38:04,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-04 07:38:04,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:04,724 INFO L225 Difference]: With dead ends: 173 [2025-03-04 07:38:04,724 INFO L226 Difference]: Without dead ends: 173 [2025-03-04 07:38:04,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:38:04,725 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 6 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:04,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 402 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:38:04,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-04 07:38:04,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 168. [2025-03-04 07:38:04,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 128 states have (on average 1.65625) internal successors, (212), 167 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-04 07:38:04,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 212 transitions. [2025-03-04 07:38:04,732 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 212 transitions. Word has length 23 [2025-03-04 07:38:04,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:04,732 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 212 transitions. [2025-03-04 07:38:04,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:04,733 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 212 transitions. [2025-03-04 07:38:04,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 07:38:04,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:04,733 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] [2025-03-04 07:38:04,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:38:04,733 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:38:04,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:04,733 INFO L85 PathProgramCache]: Analyzing trace with hash -956858892, now seen corresponding path program 1 times [2025-03-04 07:38:04,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:04,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257572645] [2025-03-04 07:38:04,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:04,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:04,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:38:04,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:38:04,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:04,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:04,796 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-04 07:38:04,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:04,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257572645] [2025-03-04 07:38:04,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257572645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:38:04,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:38:04,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:38:04,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397459167] [2025-03-04 07:38:04,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:04,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:38:04,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:04,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:38:04,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:38:04,797 INFO L87 Difference]: Start difference. First operand 168 states and 212 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:04,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:04,878 INFO L93 Difference]: Finished difference Result 192 states and 213 transitions. [2025-03-04 07:38:04,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:38:04,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-04 07:38:04,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:04,879 INFO L225 Difference]: With dead ends: 192 [2025-03-04 07:38:04,879 INFO L226 Difference]: Without dead ends: 192 [2025-03-04 07:38:04,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:38:04,880 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 78 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:04,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 251 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:38:04,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-04 07:38:04,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 169. [2025-03-04 07:38:04,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 129 states have (on average 1.6511627906976745) internal successors, (213), 168 states have internal predecessors, (213), 0 states have call successors, (0), 0 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-04 07:38:04,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 213 transitions. [2025-03-04 07:38:04,883 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 213 transitions. Word has length 23 [2025-03-04 07:38:04,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:04,883 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 213 transitions. [2025-03-04 07:38:04,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:04,883 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 213 transitions. [2025-03-04 07:38:04,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 07:38:04,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:04,884 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:38:04,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 07:38:04,884 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:38:04,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:04,884 INFO L85 PathProgramCache]: Analyzing trace with hash -85323302, now seen corresponding path program 1 times [2025-03-04 07:38:04,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:04,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761498842] [2025-03-04 07:38:04,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:04,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:04,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:38:04,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:38:04,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:04,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:05,101 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-04 07:38:05,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:05,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761498842] [2025-03-04 07:38:05,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761498842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:38:05,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:38:05,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:38:05,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665541467] [2025-03-04 07:38:05,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:05,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:38:05,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:05,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:38:05,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:38:05,103 INFO L87 Difference]: Start difference. First operand 169 states and 213 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:05,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:05,225 INFO L93 Difference]: Finished difference Result 178 states and 224 transitions. [2025-03-04 07:38:05,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:38:05,226 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-04 07:38:05,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:05,226 INFO L225 Difference]: With dead ends: 178 [2025-03-04 07:38:05,227 INFO L226 Difference]: Without dead ends: 178 [2025-03-04 07:38:05,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:38:05,227 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 15 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:05,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 409 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:38:05,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-04 07:38:05,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2025-03-04 07:38:05,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 135 states have (on average 1.6222222222222222) internal successors, (219), 174 states have internal predecessors, (219), 0 states have call successors, (0), 0 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-04 07:38:05,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 219 transitions. [2025-03-04 07:38:05,234 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 219 transitions. Word has length 26 [2025-03-04 07:38:05,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:05,234 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 219 transitions. [2025-03-04 07:38:05,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 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-04 07:38:05,234 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 219 transitions. [2025-03-04 07:38:05,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 07:38:05,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:05,235 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:38:05,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 07:38:05,235 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:38:05,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:05,235 INFO L85 PathProgramCache]: Analyzing trace with hash -85322950, now seen corresponding path program 1 times [2025-03-04 07:38:05,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:05,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244174951] [2025-03-04 07:38:05,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:05,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:05,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:38:05,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:38:05,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:05,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:05,543 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-04 07:38:05,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:05,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244174951] [2025-03-04 07:38:05,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244174951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:38:05,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:38:05,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 07:38:05,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402220508] [2025-03-04 07:38:05,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:05,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:38:05,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:05,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:38:05,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:38:05,545 INFO L87 Difference]: Start difference. First operand 175 states and 219 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:05,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:05,801 INFO L93 Difference]: Finished difference Result 188 states and 235 transitions. [2025-03-04 07:38:05,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:38:05,801 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-04 07:38:05,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:05,802 INFO L225 Difference]: With dead ends: 188 [2025-03-04 07:38:05,802 INFO L226 Difference]: Without dead ends: 188 [2025-03-04 07:38:05,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:38:05,802 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 40 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:05,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 335 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:38:05,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-04 07:38:05,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 176. [2025-03-04 07:38:05,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 136 states have (on average 1.625) internal successors, (221), 175 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-04 07:38:05,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 221 transitions. [2025-03-04 07:38:05,806 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 221 transitions. Word has length 26 [2025-03-04 07:38:05,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:05,807 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 221 transitions. [2025-03-04 07:38:05,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:05,807 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 221 transitions. [2025-03-04 07:38:05,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 07:38:05,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:05,807 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:38:05,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 07:38:05,807 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:38:05,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:05,808 INFO L85 PathProgramCache]: Analyzing trace with hash -85322949, now seen corresponding path program 1 times [2025-03-04 07:38:05,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:05,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043591096] [2025-03-04 07:38:05,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:05,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:05,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:38:05,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:38:05,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:05,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:06,111 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-04 07:38:06,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:06,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043591096] [2025-03-04 07:38:06,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043591096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:38:06,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:38:06,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:38:06,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940591458] [2025-03-04 07:38:06,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:06,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:38:06,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:06,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:38:06,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:38:06,113 INFO L87 Difference]: Start difference. First operand 176 states and 221 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:06,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:06,344 INFO L93 Difference]: Finished difference Result 187 states and 231 transitions. [2025-03-04 07:38:06,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:38:06,344 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-04 07:38:06,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:06,345 INFO L225 Difference]: With dead ends: 187 [2025-03-04 07:38:06,345 INFO L226 Difference]: Without dead ends: 187 [2025-03-04 07:38:06,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:38:06,345 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 47 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:06,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 257 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:38:06,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-04 07:38:06,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 176. [2025-03-04 07:38:06,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 136 states have (on average 1.6176470588235294) internal successors, (220), 175 states have internal predecessors, (220), 0 states have call successors, (0), 0 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-04 07:38:06,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 220 transitions. [2025-03-04 07:38:06,348 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 220 transitions. Word has length 26 [2025-03-04 07:38:06,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:06,348 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 220 transitions. [2025-03-04 07:38:06,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:06,348 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 220 transitions. [2025-03-04 07:38:06,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:38:06,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:06,349 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:38:06,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 07:38:06,349 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:38:06,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:06,349 INFO L85 PathProgramCache]: Analyzing trace with hash -390976968, now seen corresponding path program 1 times [2025-03-04 07:38:06,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:06,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505845748] [2025-03-04 07:38:06,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:06,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:06,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:38:06,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:38:06,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:06,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:06,506 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-04 07:38:06,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:06,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505845748] [2025-03-04 07:38:06,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505845748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:38:06,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:38:06,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:38:06,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586992112] [2025-03-04 07:38:06,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:06,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:38:06,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:06,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:38:06,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:38:06,508 INFO L87 Difference]: Start difference. First operand 176 states and 220 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 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-04 07:38:06,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:06,703 INFO L93 Difference]: Finished difference Result 189 states and 233 transitions. [2025-03-04 07:38:06,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:38:06,704 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-04 07:38:06,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:06,705 INFO L225 Difference]: With dead ends: 189 [2025-03-04 07:38:06,705 INFO L226 Difference]: Without dead ends: 189 [2025-03-04 07:38:06,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:38:06,705 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 31 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:06,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 522 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:38:06,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-04 07:38:06,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 178. [2025-03-04 07:38:06,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 138 states have (on average 1.608695652173913) internal successors, (222), 177 states have internal predecessors, (222), 0 states have call successors, (0), 0 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-04 07:38:06,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 222 transitions. [2025-03-04 07:38:06,708 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 222 transitions. Word has length 28 [2025-03-04 07:38:06,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:06,708 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 222 transitions. [2025-03-04 07:38:06,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 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-04 07:38:06,709 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 222 transitions. [2025-03-04 07:38:06,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 07:38:06,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:06,709 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] [2025-03-04 07:38:06,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 07:38:06,709 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:38:06,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:06,710 INFO L85 PathProgramCache]: Analyzing trace with hash 764615856, now seen corresponding path program 1 times [2025-03-04 07:38:06,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:06,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886768211] [2025-03-04 07:38:06,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:06,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:06,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:38:06,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:38:06,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:06,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:06,898 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-04 07:38:06,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:06,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886768211] [2025-03-04 07:38:06,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886768211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:38:06,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:38:06,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:38:06,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717769561] [2025-03-04 07:38:06,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:06,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:38:06,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:06,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:38:06,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:38:06,900 INFO L87 Difference]: Start difference. First operand 178 states and 222 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:07,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:07,132 INFO L93 Difference]: Finished difference Result 190 states and 234 transitions. [2025-03-04 07:38:07,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:38:07,133 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-04 07:38:07,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:07,134 INFO L225 Difference]: With dead ends: 190 [2025-03-04 07:38:07,134 INFO L226 Difference]: Without dead ends: 190 [2025-03-04 07:38:07,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:38:07,134 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 37 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:07,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 478 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:38:07,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-04 07:38:07,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 179. [2025-03-04 07:38:07,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 139 states have (on average 1.60431654676259) internal successors, (223), 178 states have internal predecessors, (223), 0 states have call successors, (0), 0 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-04 07:38:07,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 223 transitions. [2025-03-04 07:38:07,138 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 223 transitions. Word has length 29 [2025-03-04 07:38:07,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:07,138 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 223 transitions. [2025-03-04 07:38:07,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:07,138 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 223 transitions. [2025-03-04 07:38:07,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 07:38:07,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:07,139 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:38:07,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 07:38:07,139 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:38:07,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:07,140 INFO L85 PathProgramCache]: Analyzing trace with hash -2066712266, now seen corresponding path program 1 times [2025-03-04 07:38:07,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:07,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539057455] [2025-03-04 07:38:07,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:07,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:07,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:38:07,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:38:07,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:07,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:07,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:38:07,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:07,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539057455] [2025-03-04 07:38:07,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539057455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:38:07,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:38:07,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:38:07,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25819817] [2025-03-04 07:38:07,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:07,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:38:07,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:07,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:38:07,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:38:07,177 INFO L87 Difference]: Start difference. First operand 179 states and 223 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:07,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:07,296 INFO L93 Difference]: Finished difference Result 243 states and 310 transitions. [2025-03-04 07:38:07,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:38:07,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-04 07:38:07,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:07,298 INFO L225 Difference]: With dead ends: 243 [2025-03-04 07:38:07,298 INFO L226 Difference]: Without dead ends: 243 [2025-03-04 07:38:07,298 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-04 07:38:07,298 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 64 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:07,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 230 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:38:07,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-04 07:38:07,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 183. [2025-03-04 07:38:07,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 145 states have (on average 1.6137931034482758) internal successors, (234), 182 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:07,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 234 transitions. [2025-03-04 07:38:07,302 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 234 transitions. Word has length 30 [2025-03-04 07:38:07,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:07,302 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 234 transitions. [2025-03-04 07:38:07,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:07,302 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 234 transitions. [2025-03-04 07:38:07,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 07:38:07,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:07,302 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] [2025-03-04 07:38:07,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 07:38:07,303 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:38:07,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:07,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1835597741, now seen corresponding path program 1 times [2025-03-04 07:38:07,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:07,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815427851] [2025-03-04 07:38:07,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:07,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:07,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:38:07,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:38:07,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:07,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:07,582 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-04 07:38:07,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:07,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815427851] [2025-03-04 07:38:07,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815427851] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:38:07,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535699615] [2025-03-04 07:38:07,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:07,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:07,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:38:07,586 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-04 07:38:07,587 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-04 07:38:07,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:38:07,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:38:07,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:07,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:07,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 07:38:07,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:38:07,805 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 15 treesize of output 1 [2025-03-04 07:38:07,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:38:07,900 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 46 treesize of output 36 [2025-03-04 07:38:08,188 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~data~0#1.base_44| Int) (|v_ULTIMATE.start_main_~item2~0#1.base_25| Int)) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~item2~0#1.base_25| 1) |v_ULTIMATE.start_main_~data~0#1.base_44|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~item2~0#1.base_25|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~data~0#1.base_44| 0) |v_ULTIMATE.start_main_~item2~0#1.base_25| 0)))) is different from true [2025-03-04 07:38:08,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-03-04 07:38:08,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:38:08,318 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 48 treesize of output 44 [2025-03-04 07:38:12,806 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-04 07:38:12,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535699615] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:38:12,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:38:12,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 30 [2025-03-04 07:38:12,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629963733] [2025-03-04 07:38:12,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:38:12,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 07:38:12,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:12,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 07:38:12,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=773, Unknown=2, NotChecked=56, Total=930 [2025-03-04 07:38:12,808 INFO L87 Difference]: Start difference. First operand 183 states and 234 transitions. Second operand has 31 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 31 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-04 07:38:13,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:13,664 INFO L93 Difference]: Finished difference Result 195 states and 246 transitions. [2025-03-04 07:38:13,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:38:13,665 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 31 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-04 07:38:13,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:13,665 INFO L225 Difference]: With dead ends: 195 [2025-03-04 07:38:13,665 INFO L226 Difference]: Without dead ends: 194 [2025-03-04 07:38:13,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=175, Invalid=1309, Unknown=2, NotChecked=74, Total=1560 [2025-03-04 07:38:13,666 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 31 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:13,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 714 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 946 Invalid, 0 Unknown, 147 Unchecked, 0.6s Time] [2025-03-04 07:38:13,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-04 07:38:13,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 185. [2025-03-04 07:38:13,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 147 states have (on average 1.6054421768707483) internal successors, (236), 184 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:13,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 236 transitions. [2025-03-04 07:38:13,669 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 236 transitions. Word has length 32 [2025-03-04 07:38:13,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:13,669 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 236 transitions. [2025-03-04 07:38:13,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 31 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-04 07:38:13,670 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 236 transitions. [2025-03-04 07:38:13,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 07:38:13,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:13,670 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:38:13,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:38:13,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:13,874 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:38:13,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:13,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1835597389, now seen corresponding path program 1 times [2025-03-04 07:38:13,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:13,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644308337] [2025-03-04 07:38:13,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:13,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:13,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:38:13,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:38:13,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:13,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:14,296 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:38:14,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:14,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644308337] [2025-03-04 07:38:14,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644308337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:38:14,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067339389] [2025-03-04 07:38:14,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:14,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:14,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:38:14,299 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-04 07:38:14,301 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-04 07:38:14,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:38:14,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:38:14,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:14,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:14,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-04 07:38:14,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:38:14,393 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-04 07:38:14,396 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-04 07:38:14,407 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 23 treesize of output 11 [2025-03-04 07:38:14,411 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 23 treesize of output 11 [2025-03-04 07:38:14,457 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:38:14,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-04 07:38:14,472 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:38:14,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-04 07:38:14,532 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-04 07:38:14,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2025-03-04 07:38:14,539 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 35 treesize of output 23 [2025-03-04 07:38:14,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:38:14,884 INFO L349 Elim1Store]: treesize reduction 8, result has 50.0 percent of original size [2025-03-04 07:38:14,885 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 95 treesize of output 91 [2025-03-04 07:38:14,944 INFO L349 Elim1Store]: treesize reduction 28, result has 69.9 percent of original size [2025-03-04 07:38:14,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 87 treesize of output 117 [2025-03-04 07:38:14,993 INFO L349 Elim1Store]: treesize reduction 4, result has 91.8 percent of original size [2025-03-04 07:38:14,993 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 49 treesize of output 85 [2025-03-04 07:38:15,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:38:15,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:38:15,297 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 10 treesize of output 8 [2025-03-04 07:38:15,604 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 49 treesize of output 45 [2025-03-04 07:38:15,714 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0))) (let ((.cse3 (not .cse1))) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_23 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_23) (forall ((v_ArrVal_513 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_513))) (or (= (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse0 v_arrayElimCell_23) 0) 0)))))))) (or .cse1 (and (forall ((v_ArrVal_513 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_23 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_23) (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_513) v_arrayElimCell_23) 0) 0))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_23 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_23) (forall ((v_ArrVal_513 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_513))) (or (= (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse2 v_arrayElimCell_23) 0) 0)))))))) (or .cse1 (forall ((v_ArrVal_513 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_23 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_23) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_513) v_arrayElimCell_23) 0) 0)))) (or .cse3 (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_ArrVal_513 (Array Int Int)) (v_arrayElimCell_23 Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_513))) (or (= (select (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse4 v_arrayElimCell_23) 0) 0)))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_ArrVal_513 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))))) (or .cse3 (forall ((v_ArrVal_513 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_510 (Array Int Int))) (let ((.cse5 (select (store v_ArrVal_510 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|) 4))) (or (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_510) .cse5) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse5))))))) is different from false [2025-03-04 07:38:15,955 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 15 treesize of output 13 [2025-03-04 07:38:15,957 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 48 treesize of output 46 [2025-03-04 07:38:15,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:38:15,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067339389] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:38:15,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:38:15,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 40 [2025-03-04 07:38:15,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190122492] [2025-03-04 07:38:15,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:38:15,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-04 07:38:15,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:15,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 07:38:15,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1316, Unknown=8, NotChecked=74, Total=1560 [2025-03-04 07:38:15,970 INFO L87 Difference]: Start difference. First operand 185 states and 236 transitions. Second operand has 40 states, 40 states have (on average 1.8) internal successors, (72), 40 states have internal predecessors, (72), 0 states have call successors, (0), 0 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-04 07:38:16,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:16,805 INFO L93 Difference]: Finished difference Result 193 states and 243 transitions. [2025-03-04 07:38:16,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 07:38:16,806 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.8) internal successors, (72), 40 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-04 07:38:16,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:16,806 INFO L225 Difference]: With dead ends: 193 [2025-03-04 07:38:16,806 INFO L226 Difference]: Without dead ends: 178 [2025-03-04 07:38:16,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=269, Invalid=1889, Unknown=8, NotChecked=90, Total=2256 [2025-03-04 07:38:16,807 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 60 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:16,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1258 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1106 Invalid, 0 Unknown, 77 Unchecked, 0.6s Time] [2025-03-04 07:38:16,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-04 07:38:16,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 170. [2025-03-04 07:38:16,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 132 states have (on average 1.6666666666666667) internal successors, (220), 169 states have internal predecessors, (220), 0 states have call successors, (0), 0 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-04 07:38:16,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 220 transitions. [2025-03-04 07:38:16,810 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 220 transitions. Word has length 32 [2025-03-04 07:38:16,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:16,810 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 220 transitions. [2025-03-04 07:38:16,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.8) internal successors, (72), 40 states have internal predecessors, (72), 0 states have call successors, (0), 0 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-04 07:38:16,810 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 220 transitions. [2025-03-04 07:38:16,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 07:38:16,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:16,810 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:38:16,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 07:38:17,014 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,SelfDestructingSolverStorable20 [2025-03-04 07:38:17,014 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:38:17,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:17,014 INFO L85 PathProgramCache]: Analyzing trace with hash 507155363, now seen corresponding path program 1 times [2025-03-04 07:38:17,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:17,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810420470] [2025-03-04 07:38:17,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:17,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:17,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:38:17,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:38:17,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:17,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:17,180 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:38:17,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:17,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810420470] [2025-03-04 07:38:17,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810420470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:38:17,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141037391] [2025-03-04 07:38:17,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:17,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:17,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:38:17,182 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-04 07:38:17,184 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-04 07:38:17,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:38:17,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:38:17,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:17,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:17,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 07:38:17,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:38:17,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:38:17,328 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-04 07:38:17,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:38:17,351 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2025-03-04 07:38:17,387 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 17 treesize of output 9 [2025-03-04 07:38:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:38:17,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:38:25,536 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:38:25,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141037391] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:38:25,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:38:25,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 18 [2025-03-04 07:38:25,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668663497] [2025-03-04 07:38:25,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:38:25,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 07:38:25,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:25,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 07:38:25,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=278, Unknown=2, NotChecked=0, Total=342 [2025-03-04 07:38:25,539 INFO L87 Difference]: Start difference. First operand 170 states and 220 transitions. Second operand has 19 states, 18 states have (on average 4.666666666666667) internal successors, (84), 19 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:26,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:26,252 INFO L93 Difference]: Finished difference Result 194 states and 221 transitions. [2025-03-04 07:38:26,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:38:26,252 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.666666666666667) internal successors, (84), 19 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-04 07:38:26,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:26,253 INFO L225 Difference]: With dead ends: 194 [2025-03-04 07:38:26,253 INFO L226 Difference]: Without dead ends: 194 [2025-03-04 07:38:26,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=198, Invalid=730, Unknown=2, NotChecked=0, Total=930 [2025-03-04 07:38:26,254 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 137 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:26,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 893 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:38:26,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-04 07:38:26,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 170. [2025-03-04 07:38:26,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 132 states have (on average 1.6590909090909092) internal successors, (219), 169 states have internal predecessors, (219), 0 states have call successors, (0), 0 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-04 07:38:26,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 219 transitions. [2025-03-04 07:38:26,260 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 219 transitions. Word has length 37 [2025-03-04 07:38:26,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:26,260 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 219 transitions. [2025-03-04 07:38:26,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.666666666666667) internal successors, (84), 19 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:26,261 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 219 transitions. [2025-03-04 07:38:26,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 07:38:26,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:26,261 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:38:26,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 07:38:26,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:26,465 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:38:26,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:26,465 INFO L85 PathProgramCache]: Analyzing trace with hash 507155364, now seen corresponding path program 1 times [2025-03-04 07:38:26,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:26,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948160096] [2025-03-04 07:38:26,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:26,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:26,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:38:26,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:38:26,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:26,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:26,706 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:38:26,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:26,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948160096] [2025-03-04 07:38:26,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948160096] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:38:26,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719253343] [2025-03-04 07:38:26,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:26,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:26,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:38:26,709 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-04 07:38:26,710 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-04 07:38:26,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:38:26,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:38:26,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:26,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:26,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 07:38:26,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:38:26,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:38:26,897 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-04 07:38:26,905 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-04 07:38:26,934 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 42 [2025-03-04 07:38:26,940 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 35 treesize of output 11 [2025-03-04 07:38:26,996 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 17 treesize of output 9 [2025-03-04 07:38:27,011 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:38:27,012 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:38:27,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719253343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:38:27,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:38:27,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2025-03-04 07:38:27,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997996552] [2025-03-04 07:38:27,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:27,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:38:27,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:27,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:38:27,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:38:27,013 INFO L87 Difference]: Start difference. First operand 170 states and 219 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 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-04 07:38:27,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:27,220 INFO L93 Difference]: Finished difference Result 193 states and 220 transitions. [2025-03-04 07:38:27,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:38:27,220 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 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 37 [2025-03-04 07:38:27,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:27,221 INFO L225 Difference]: With dead ends: 193 [2025-03-04 07:38:27,221 INFO L226 Difference]: Without dead ends: 193 [2025-03-04 07:38:27,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:38:27,221 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 60 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:27,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 403 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:38:27,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-04 07:38:27,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 170. [2025-03-04 07:38:27,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 132 states have (on average 1.6515151515151516) internal successors, (218), 169 states have internal predecessors, (218), 0 states have call successors, (0), 0 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-04 07:38:27,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 218 transitions. [2025-03-04 07:38:27,224 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 218 transitions. Word has length 37 [2025-03-04 07:38:27,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:27,225 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 218 transitions. [2025-03-04 07:38:27,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 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-04 07:38:27,225 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 218 transitions. [2025-03-04 07:38:27,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 07:38:27,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:27,225 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:38:27,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 07:38:27,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:27,429 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:38:27,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:27,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1808529111, now seen corresponding path program 1 times [2025-03-04 07:38:27,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:27,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662517873] [2025-03-04 07:38:27,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:27,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:27,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:38:27,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:38:27,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:27,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:27,576 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:38:27,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:27,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662517873] [2025-03-04 07:38:27,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662517873] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:38:27,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262493595] [2025-03-04 07:38:27,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:27,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:27,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:38:27,579 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-04 07:38:27,604 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-04 07:38:27,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:38:27,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:38:27,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:27,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:27,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 07:38:27,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:38:27,781 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-04 07:38:27,816 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-03-04 07:38:27,816 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 40 treesize of output 38 [2025-03-04 07:38:27,932 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-03-04 07:38:27,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 30 [2025-03-04 07:38:27,976 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:38:27,977 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:38:27,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262493595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:38:27,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:38:27,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2025-03-04 07:38:27,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589387478] [2025-03-04 07:38:27,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:27,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:38:27,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:27,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:38:27,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:38:27,977 INFO L87 Difference]: Start difference. First operand 170 states and 218 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:28,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:28,216 INFO L93 Difference]: Finished difference Result 182 states and 230 transitions. [2025-03-04 07:38:28,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:38:28,216 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-04 07:38:28,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:28,217 INFO L225 Difference]: With dead ends: 182 [2025-03-04 07:38:28,217 INFO L226 Difference]: Without dead ends: 182 [2025-03-04 07:38:28,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2025-03-04 07:38:28,218 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 25 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:28,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 491 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:38:28,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-04 07:38:28,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 172. [2025-03-04 07:38:28,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 134 states have (on average 1.6417910447761195) internal successors, (220), 171 states have internal predecessors, (220), 0 states have call successors, (0), 0 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-04 07:38:28,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 220 transitions. [2025-03-04 07:38:28,221 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 220 transitions. Word has length 40 [2025-03-04 07:38:28,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:28,221 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 220 transitions. [2025-03-04 07:38:28,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:28,221 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 220 transitions. [2025-03-04 07:38:28,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 07:38:28,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:28,221 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:38:28,228 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-04 07:38:28,422 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,SelfDestructingSolverStorable23 [2025-03-04 07:38:28,422 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:38:28,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:28,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1808528759, now seen corresponding path program 1 times [2025-03-04 07:38:28,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:28,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943561587] [2025-03-04 07:38:28,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:28,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:28,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:38:28,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:38:28,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:28,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:28,556 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:38:28,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:28,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943561587] [2025-03-04 07:38:28,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943561587] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:38:28,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948871336] [2025-03-04 07:38:28,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:28,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:28,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:38:28,558 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-04 07:38:28,560 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-04 07:38:28,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:38:28,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:38:28,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:28,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:28,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 07:38:28,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:38:28,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:38:28,695 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:38:28,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 07:38:28,708 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:38:28,709 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-04 07:38:28,718 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 11 treesize of output 7 [2025-03-04 07:38:28,732 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:38:28,732 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 25 treesize of output 26 [2025-03-04 07:38:28,742 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 16 treesize of output 8 [2025-03-04 07:38:28,744 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:38:28,745 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:38:28,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:38:28,773 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 19 treesize of output 20 [2025-03-04 07:38:28,776 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 33 treesize of output 25 [2025-03-04 07:38:28,779 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-04 07:38:28,830 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:38:28,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948871336] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:38:28,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:38:28,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2025-03-04 07:38:28,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488834585] [2025-03-04 07:38:28,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:38:28,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:38:28,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:28,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:38:28,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=99, Unknown=2, NotChecked=0, Total=132 [2025-03-04 07:38:28,831 INFO L87 Difference]: Start difference. First operand 172 states and 220 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:29,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:29,074 INFO L93 Difference]: Finished difference Result 170 states and 215 transitions. [2025-03-04 07:38:29,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:38:29,074 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-04 07:38:29,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:29,075 INFO L225 Difference]: With dead ends: 170 [2025-03-04 07:38:29,075 INFO L226 Difference]: Without dead ends: 170 [2025-03-04 07:38:29,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=223, Unknown=2, NotChecked=0, Total=306 [2025-03-04 07:38:29,075 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 128 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:29,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 409 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:38:29,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-04 07:38:29,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 166. [2025-03-04 07:38:29,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 128 states have (on average 1.6640625) internal successors, (213), 165 states have internal predecessors, (213), 0 states have call successors, (0), 0 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-04 07:38:29,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 213 transitions. [2025-03-04 07:38:29,078 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 213 transitions. Word has length 40 [2025-03-04 07:38:29,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:29,078 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 213 transitions. [2025-03-04 07:38:29,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:29,078 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 213 transitions. [2025-03-04 07:38:29,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 07:38:29,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:29,079 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:38:29,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 07:38:29,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:29,279 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:38:29,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:29,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1848851299, now seen corresponding path program 1 times [2025-03-04 07:38:29,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:29,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683269661] [2025-03-04 07:38:29,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:29,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:29,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:38:29,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:38:29,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:29,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:29,348 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 07:38:29,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:29,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683269661] [2025-03-04 07:38:29,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683269661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:38:29,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:38:29,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:38:29,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031982212] [2025-03-04 07:38:29,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:29,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:38:29,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:29,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:38:29,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:38:29,350 INFO L87 Difference]: Start difference. First operand 166 states and 213 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-04 07:38:29,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:29,511 INFO L93 Difference]: Finished difference Result 165 states and 211 transitions. [2025-03-04 07:38:29,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:38:29,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 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-04 07:38:29,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:29,512 INFO L225 Difference]: With dead ends: 165 [2025-03-04 07:38:29,512 INFO L226 Difference]: Without dead ends: 165 [2025-03-04 07:38:29,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:38:29,512 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 19 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:29,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 301 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:38:29,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-04 07:38:29,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-03-04 07:38:29,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 128 states have (on average 1.6484375) internal successors, (211), 164 states have internal predecessors, (211), 0 states have call successors, (0), 0 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-04 07:38:29,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 211 transitions. [2025-03-04 07:38:29,516 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 211 transitions. Word has length 41 [2025-03-04 07:38:29,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:29,517 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 211 transitions. [2025-03-04 07:38:29,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-04 07:38:29,517 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 211 transitions. [2025-03-04 07:38:29,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 07:38:29,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:29,517 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:38:29,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 07:38:29,517 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:38:29,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:29,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1848851298, now seen corresponding path program 1 times [2025-03-04 07:38:29,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:29,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492023335] [2025-03-04 07:38:29,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:29,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:29,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:38:29,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:38:29,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:29,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:29,749 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:38:29,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:29,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492023335] [2025-03-04 07:38:29,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492023335] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:38:29,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787024628] [2025-03-04 07:38:29,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:29,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:29,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:38:29,751 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-04 07:38:29,753 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-04 07:38:29,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:38:29,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:38:29,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:29,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:29,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 07:38:29,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:38:29,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:38:29,969 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-04 07:38:29,975 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-04 07:38:30,007 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 42 [2025-03-04 07:38:30,013 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 35 treesize of output 11 [2025-03-04 07:38:30,087 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 17 treesize of output 9 [2025-03-04 07:38:30,119 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:38:30,120 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:38:30,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787024628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:38:30,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:38:30,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2025-03-04 07:38:30,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176962473] [2025-03-04 07:38:30,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:30,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:38:30,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:30,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:38:30,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:38:30,120 INFO L87 Difference]: Start difference. First operand 165 states and 211 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:30,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:30,249 INFO L93 Difference]: Finished difference Result 185 states and 211 transitions. [2025-03-04 07:38:30,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:38:30,250 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-04 07:38:30,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:30,250 INFO L225 Difference]: With dead ends: 185 [2025-03-04 07:38:30,250 INFO L226 Difference]: Without dead ends: 185 [2025-03-04 07:38:30,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2025-03-04 07:38:30,251 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 65 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:30,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 341 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:38:30,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-04 07:38:30,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 165. [2025-03-04 07:38:30,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 128 states have (on average 1.6328125) internal successors, (209), 164 states have internal predecessors, (209), 0 states have call successors, (0), 0 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-04 07:38:30,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 209 transitions. [2025-03-04 07:38:30,253 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 209 transitions. Word has length 41 [2025-03-04 07:38:30,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:30,253 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 209 transitions. [2025-03-04 07:38:30,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:38:30,253 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 209 transitions. [2025-03-04 07:38:30,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 07:38:30,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:30,254 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:38:30,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 07:38:30,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:30,458 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:38:30,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:30,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1635435078, now seen corresponding path program 1 times [2025-03-04 07:38:30,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:30,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584585803] [2025-03-04 07:38:30,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:30,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:30,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 07:38:30,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:38:30,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:30,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:30,643 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:38:30,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:30,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584585803] [2025-03-04 07:38:30,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584585803] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:38:30,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10049540] [2025-03-04 07:38:30,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:30,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:30,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:38:30,646 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-04 07:38:30,647 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-04 07:38:30,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 07:38:30,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:38:30,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:30,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:30,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 07:38:30,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:38:30,822 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-04 07:38:30,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:38:30,847 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2025-03-04 07:38:30,900 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 17 treesize of output 9 [2025-03-04 07:38:30,911 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:38:30,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:38:31,048 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:38:31,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10049540] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:38:31,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:38:31,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2025-03-04 07:38:31,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737542858] [2025-03-04 07:38:31,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:38:31,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 07:38:31,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:31,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 07:38:31,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-03-04 07:38:31,049 INFO L87 Difference]: Start difference. First operand 165 states and 209 transitions. Second operand has 19 states, 18 states have (on average 5.277777777777778) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-04 07:38:31,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:31,446 INFO L93 Difference]: Finished difference Result 184 states and 210 transitions. [2025-03-04 07:38:31,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 07:38:31,447 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.277777777777778) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 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-04 07:38:31,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:31,447 INFO L225 Difference]: With dead ends: 184 [2025-03-04 07:38:31,447 INFO L226 Difference]: Without dead ends: 184 [2025-03-04 07:38:31,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 07:38:31,448 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 125 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:31,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 779 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:38:31,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-04 07:38:31,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 165. [2025-03-04 07:38:31,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 128 states have (on average 1.625) internal successors, (208), 164 states have internal predecessors, (208), 0 states have call successors, (0), 0 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-04 07:38:31,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 208 transitions. [2025-03-04 07:38:31,450 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 208 transitions. Word has length 45 [2025-03-04 07:38:31,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:31,450 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 208 transitions. [2025-03-04 07:38:31,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.277777777777778) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-04 07:38:31,450 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 208 transitions. [2025-03-04 07:38:31,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 07:38:31,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:31,451 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:38:31,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 07:38:31,655 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,SelfDestructingSolverStorable27 [2025-03-04 07:38:31,655 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:38:31,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:31,655 INFO L85 PathProgramCache]: Analyzing trace with hash 862636779, now seen corresponding path program 1 times [2025-03-04 07:38:31,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:31,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752744075] [2025-03-04 07:38:31,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:31,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:31,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 07:38:31,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 07:38:31,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:31,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:32,153 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:38:32,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:32,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752744075] [2025-03-04 07:38:32,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752744075] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:38:32,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898940354] [2025-03-04 07:38:32,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:32,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:32,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:38:32,156 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-04 07:38:32,156 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-04 07:38:32,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 07:38:32,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 07:38:32,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:32,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:32,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-04 07:38:32,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:38:32,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:38:32,301 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 07:38:32,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 07:38:32,363 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-04 07:38:32,412 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2025-03-04 07:38:32,412 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 26 treesize of output 41 [2025-03-04 07:38:32,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 34 treesize of output 25 [2025-03-04 07:38:32,473 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 34 treesize of output 25 [2025-03-04 07:38:32,514 INFO L349 Elim1Store]: treesize reduction 72, result has 33.3 percent of original size [2025-03-04 07:38:32,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 48 [2025-03-04 07:38:32,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2025-03-04 07:38:32,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2025-03-04 07:38:32,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:38:32,746 INFO L349 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2025-03-04 07:38:32,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 91 [2025-03-04 07:38:33,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:38:33,159 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-04 07:38:33,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 44 [2025-03-04 07:38:33,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 07:38:33,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2025-03-04 07:38:33,410 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:38:33,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:38:33,687 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 8 treesize of output 4 [2025-03-04 07:38:34,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:38:34,806 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 198 treesize of output 129 [2025-03-04 07:38:34,808 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:38:34,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:38:34,816 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 450 treesize of output 450 [2025-03-04 07:38:34,826 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 178 treesize of output 162 [2025-03-04 07:38:34,836 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 45 treesize of output 41 [2025-03-04 07:38:34,850 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 8 treesize of output 4 [2025-03-04 07:38:34,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:38:34,860 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 54 treesize of output 54 [2025-03-04 07:38:35,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:38:35,881 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 293 treesize of output 183 [2025-03-04 07:38:35,884 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:38:35,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:38:35,900 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 1261 treesize of output 1251 [2025-03-04 07:38:35,907 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:38:35,909 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 199 treesize of output 183 [2025-03-04 07:38:35,914 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 19 treesize of output 15 [2025-03-04 07:38:35,920 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 8 treesize of output 4 [2025-03-04 07:38:35,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:38:35,933 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 33 [2025-03-04 07:38:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:38:51,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898940354] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:38:51,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:38:51,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 21] total 49 [2025-03-04 07:38:51,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770386347] [2025-03-04 07:38:51,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:38:51,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-04 07:38:51,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:51,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-04 07:38:51,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=2105, Unknown=23, NotChecked=0, Total=2450 [2025-03-04 07:38:51,321 INFO L87 Difference]: Start difference. First operand 165 states and 208 transitions. Second operand has 50 states, 49 states have (on average 2.7755102040816326) internal successors, (136), 50 states have internal predecessors, (136), 0 states have call successors, (0), 0 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-04 07:39:02,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-04 07:39:08,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:39:08,966 INFO L93 Difference]: Finished difference Result 207 states and 256 transitions. [2025-03-04 07:39:08,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 07:39:08,967 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.7755102040816326) internal successors, (136), 50 states have internal predecessors, (136), 0 states have call successors, (0), 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 48 [2025-03-04 07:39:08,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:39:08,967 INFO L225 Difference]: With dead ends: 207 [2025-03-04 07:39:08,967 INFO L226 Difference]: Without dead ends: 207 [2025-03-04 07:39:08,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=639, Invalid=3119, Unknown=24, NotChecked=0, Total=3782 [2025-03-04 07:39:08,968 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 120 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 2150 mSolverCounterSat, 26 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 2178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2150 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:39:08,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1133 Invalid, 2178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2150 Invalid, 2 Unknown, 0 Unchecked, 14.6s Time] [2025-03-04 07:39:08,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-04 07:39:08,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 163. [2025-03-04 07:39:08,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 126 states have (on average 1.6111111111111112) internal successors, (203), 162 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-04 07:39:08,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 203 transitions. [2025-03-04 07:39:08,970 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 203 transitions. Word has length 48 [2025-03-04 07:39:08,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:39:08,971 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 203 transitions. [2025-03-04 07:39:08,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.7755102040816326) internal successors, (136), 50 states have internal predecessors, (136), 0 states have call successors, (0), 0 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-04 07:39:08,971 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 203 transitions. [2025-03-04 07:39:08,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 07:39:08,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:39:08,971 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:39:08,978 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-04 07:39:09,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 07:39:09,172 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-03-04 07:39:09,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:39:09,172 INFO L85 PathProgramCache]: Analyzing trace with hash 862636780, now seen corresponding path program 1 times [2025-03-04 07:39:09,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:39:09,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741200001] [2025-03-04 07:39:09,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:09,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:39:09,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 07:39:09,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 07:39:09,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:09,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:11,256 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:39:11,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:39:11,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741200001] [2025-03-04 07:39:11,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741200001] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:39:11,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093325796] [2025-03-04 07:39:11,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:11,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:39:11,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:39:11,258 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-04 07:39:11,259 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-04 07:39:11,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 07:39:11,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 07:39:11,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:11,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:11,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-04 07:39:11,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:39:11,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:39:11,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:39:11,613 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:39:11,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 07:39:11,740 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 07:39:11,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 07:39:12,248 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-04 07:39:12,284 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-04 07:39:12,729 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2025-03-04 07:39:12,729 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-04 07:39:12,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-04 07:39:13,032 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 43 treesize of output 32 [2025-03-04 07:39:13,098 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 16 treesize of output 11 [2025-03-04 07:39:13,212 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 43 treesize of output 32 [2025-03-04 07:39:13,249 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 16 treesize of output 11 [2025-03-04 07:39:13,381 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-03-04 07:39:13,381 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-04 07:39:13,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-04 07:39:13,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:39:13,954 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 34 treesize of output 25 [2025-03-04 07:39:14,065 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 37 treesize of output 28 [2025-03-04 07:39:14,123 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 23 treesize of output 11 [2025-03-04 07:39:14,373 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:39:14,374 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 79 treesize of output 66 [2025-03-04 07:39:14,384 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 24 treesize of output 11 [2025-03-04 07:39:15,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 07:39:15,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:39:15,767 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 61 treesize of output 29 [2025-03-04 07:39:16,407 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:39:16,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:39:17,206 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_1663 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1663) |c_ULTIMATE.start_main_~data~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1664 (Array Int Int)) (v_ArrVal_1663 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1663) |c_ULTIMATE.start_main_~data~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1664) |c_ULTIMATE.start_main_~data~0#1.base|) .cse0)))))) is different from false [2025-03-04 07:39:17,238 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.offset| Int) (v_ArrVal_1663 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~data~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~data~0#1.offset| |ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1663) |c_ULTIMATE.start_main_~data~0#1.base|) .cse1) 4))) (forall ((|ULTIMATE.start_main_~lItem~0#1.offset| Int) (v_ArrVal_1664 (Array Int Int)) (v_ArrVal_1663 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~data~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~data~0#1.offset| |ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1663) |c_ULTIMATE.start_main_~data~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1664) |c_ULTIMATE.start_main_~data~0#1.base|) .cse1)))))) is different from false [2025-03-04 07:39:17,317 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.offset| Int) (v_ArrVal_1663 (Array Int Int)) (v_ArrVal_1660 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1660) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1663) |c_ULTIMATE.start_main_~data~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1659 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.offset| Int) (v_ArrVal_1664 (Array Int Int)) (v_ArrVal_1663 (Array Int Int)) (v_ArrVal_1660 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1660) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1663) |c_ULTIMATE.start_main_~data~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1659) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1664) |c_ULTIMATE.start_main_~data~0#1.base|) .cse0)))))) is different from false [2025-03-04 07:39:19,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:39:19,485 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 51 treesize of output 42 [2025-03-04 07:39:19,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:39:19,530 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 175 treesize of output 168 [2025-03-04 07:39:19,542 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 29 treesize of output 25 [2025-03-04 07:39:19,554 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 13 treesize of output 9 [2025-03-04 07:39:19,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:39:19,986 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 105 treesize of output 96 [2025-03-04 07:39:20,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:39:20,012 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 85 treesize of output 76 [2025-03-04 07:39:20,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:39:20,075 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 481 treesize of output 474 [2025-03-04 07:39:20,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:39:20,164 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 813 treesize of output 782 [2025-03-04 07:39:20,180 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 49 treesize of output 45 [2025-03-04 07:39:20,193 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 45 treesize of output 41 [2025-03-04 07:39:20,206 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 25 treesize of output 21 [2025-03-04 07:39:20,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-03-04 07:39:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-03-04 07:39:23,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093325796] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:39:23,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:39:23,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2025-03-04 07:39:23,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782807291] [2025-03-04 07:39:23,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:39:23,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-04 07:39:23,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:39:23,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 07:39:23,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1161, Unknown=6, NotChecked=216, Total=1560 [2025-03-04 07:39:23,278 INFO L87 Difference]: Start difference. First operand 163 states and 203 transitions. Second operand has 40 states, 39 states have (on average 3.5384615384615383) internal successors, (138), 40 states have internal predecessors, (138), 0 states have call successors, (0), 0 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-04 07:39:27,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]